Base | Representation |
---|---|
bin | 1101101100100110111010… |
… | …10010010000101010001111 |
3 | 10221122110001012120122002101 |
4 | 12312103131102100222033 |
5 | 12421441301421343434 |
6 | 144020540405335531 |
7 | 6226046153125633 |
oct | 666233522205217 |
9 | 127573035518071 |
10 | 30120023231119 |
11 | 9662914983048 |
12 | 3465566a075a7 |
13 | 13a63c939b633 |
14 | 761b6181cdc3 |
15 | 373756d1cb14 |
hex | 1b64dd490a8f |
30120023231119 has 2 divisors, whose sum is σ = 30120023231120. Its totient is φ = 30120023231118.
The previous prime is 30120023231059. The next prime is 30120023231147. The reversal of 30120023231119 is 91113232002103.
It is an a-pointer prime, because the next prime (30120023231147) can be obtained adding 30120023231119 to its sum of digits (28).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 30120023231119 - 29 = 30120023230607 is a prime.
It is a super-2 number, since 2×301200232311192 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30120023231159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15060011615559 + 15060011615560.
It is an arithmetic number, because the mean of its divisors is an integer number (15060011615560).
Almost surely, 230120023231119 is an apocalyptic number.
30120023231119 is a deficient number, since it is larger than the sum of its proper divisors (1).
30120023231119 is an equidigital number, since it uses as much as digits as its factorization.
30120023231119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 28.
The spelling of 30120023231119 in words is "thirty trillion, one hundred twenty billion, twenty-three million, two hundred thirty-one thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •