Base | Representation |
---|---|
bin | 1101101100000001110100… |
… | …11111011001111000001001 |
3 | 10221120112122120022110022112 |
4 | 12312000322133121320021 |
5 | 12421130012200340403 |
6 | 144003444533232105 |
7 | 6224442560363141 |
oct | 666007237317011 |
9 | 127515576273275 |
10 | 30100112121353 |
11 | 965542764762a |
12 | 346172a792635 |
13 | 13a4575247791 |
14 | 760bd3275921 |
15 | 372e8dcae9d8 |
hex | 1b603a7d9e09 |
30100112121353 has 2 divisors, whose sum is σ = 30100112121354. Its totient is φ = 30100112121352.
The previous prime is 30100112121301. The next prime is 30100112121367. The reversal of 30100112121353 is 35312121100103.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27564463534969 + 2535648586384 = 5250187^2 + 1592372^2 .
It is a cyclic number.
It is not a de Polignac number, because 30100112121353 - 244 = 12507926076937 is a prime.
It is not a weakly prime, because it can be changed into another prime (30100112121853) 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, 15050056060676 + 15050056060677.
It is an arithmetic number, because the mean of its divisors is an integer number (15050056060677).
Almost surely, 230100112121353 is an apocalyptic number.
It is an amenable number.
30100112121353 is a deficient number, since it is larger than the sum of its proper divisors (1).
30100112121353 is an equidigital number, since it uses as much as digits as its factorization.
30100112121353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 30100112121353 its reverse (35312121100103), we get a palindrome (65412233221456).
The spelling of 30100112121353 in words is "thirty trillion, one hundred billion, one hundred twelve million, one hundred twenty-one thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •