Base | Representation |
---|---|
bin | 1101110010100001001100… |
… | …10000101101001001100001 |
3 | 10222100212020202002102000111 |
4 | 12321100212100231021201 |
5 | 12433303212410220301 |
6 | 144254124521451321 |
7 | 6246525646644133 |
oct | 671204620551141 |
9 | 128325222072014 |
10 | 30323111023201 |
11 | 9730a60718127 |
12 | 34989a4640b41 |
13 | 13bc5c332ccc9 |
14 | 76b909a3b053 |
15 | 378b913c8551 |
hex | 1b942642d261 |
30323111023201 has 2 divisors, whose sum is σ = 30323111023202. Its totient is φ = 30323111023200.
The previous prime is 30323111023187. The next prime is 30323111023211. The reversal of 30323111023201 is 10232011132303.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 26753732104801 + 3569378918400 = 5172401^2 + 1889280^2 .
It is a cyclic number.
It is not a de Polignac number, because 30323111023201 - 29 = 30323111022689 is a prime.
It is not a weakly prime, because it can be changed into another prime (30323111023211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15161555511600 + 15161555511601.
It is an arithmetic number, because the mean of its divisors is an integer number (15161555511601).
Almost surely, 230323111023201 is an apocalyptic number.
It is an amenable number.
30323111023201 is a deficient number, since it is larger than the sum of its proper divisors (1).
30323111023201 is an equidigital number, since it uses as much as digits as its factorization.
30323111023201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 30323111023201 its reverse (10232011132303), we get a palindrome (40555122155504).
The spelling of 30323111023201 in words is "thirty trillion, three hundred twenty-three billion, one hundred eleven million, twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •