Base | Representation |
---|---|
bin | 1101101111110111110000… |
… | …00010000010001100100101 |
3 | 10222001011102220011002222211 |
4 | 12313323320002002030211 |
5 | 12430310411111041401 |
6 | 144144242012523421 |
7 | 6240125432315335 |
oct | 667737002021445 |
9 | 128034386132884 |
10 | 30232141112101 |
11 | 96a6419564515 |
12 | 3483236a80571 |
13 | 13b3b565a7146 |
14 | 767359dc50c5 |
15 | 376619d10951 |
hex | 1b7ef8082325 |
30232141112101 has 2 divisors, whose sum is σ = 30232141112102. Its totient is φ = 30232141112100.
The previous prime is 30232141112027. The next prime is 30232141112119. The reversal of 30232141112101 is 10121114123203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30207664822500 + 24476289601 = 5496150^2 + 156449^2 .
It is an emirp because it is prime and its reverse (10121114123203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30232141112101 - 29 = 30232141111589 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30232141112161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15116070556050 + 15116070556051.
It is an arithmetic number, because the mean of its divisors is an integer number (15116070556051).
Almost surely, 230232141112101 is an apocalyptic number.
It is an amenable number.
30232141112101 is a deficient number, since it is larger than the sum of its proper divisors (1).
30232141112101 is an equidigital number, since it uses as much as digits as its factorization.
30232141112101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 30232141112101 its reverse (10121114123203), we get a palindrome (40353255235304).
The spelling of 30232141112101 in words is "thirty trillion, two hundred thirty-two billion, one hundred forty-one million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •