Base | Representation |
---|---|
bin | 1101111000000010000011… |
… | …10110110001111011101001 |
3 | 11000000222020020202002100101 |
4 | 12330001001312301323221 |
5 | 12444404201423100441 |
6 | 144521134555105401 |
7 | 6266313332234605 |
oct | 674010166617351 |
9 | 130028206662311 |
10 | 30512552550121 |
11 | 97a43344aa214 |
12 | 3509654142261 |
13 | 1404424045975 |
14 | 776b5b742505 |
15 | 37da7c926231 |
hex | 1bc041db1ee9 |
30512552550121 has 2 divisors, whose sum is σ = 30512552550122. Its totient is φ = 30512552550120.
The previous prime is 30512552550089. The next prime is 30512552550157. The reversal of 30512552550121 is 12105525521503.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 19830669610896 + 10681882939225 = 4453164^2 + 3268315^2 .
It is a cyclic number.
It is not a de Polignac number, because 30512552550121 - 25 = 30512552550089 is a prime.
It is a super-2 number, since 2×305125525501212 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30512552559121) 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, 15256276275060 + 15256276275061.
It is an arithmetic number, because the mean of its divisors is an integer number (15256276275061).
Almost surely, 230512552550121 is an apocalyptic number.
It is an amenable number.
30512552550121 is a deficient number, since it is larger than the sum of its proper divisors (1).
30512552550121 is an equidigital number, since it uses as much as digits as its factorization.
30512552550121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75000, while the sum is 37.
The spelling of 30512552550121 in words is "thirty trillion, five hundred twelve billion, five hundred fifty-two million, five hundred fifty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •