Base | Representation |
---|---|
bin | 1101101111010100101100… |
… | …10110101111100011110001 |
3 | 10221222100212101121210100122 |
4 | 12313222112112233203301 |
5 | 12430003341030120213 |
6 | 144131450404500025 |
7 | 6235561203640055 |
oct | 667522626574361 |
9 | 127870771553318 |
10 | 30213322504433 |
11 | 9699441991aa2 |
12 | 347b6646aa615 |
13 | 13b21478aa233 |
14 | 766492987c65 |
15 | 375db7b56d08 |
hex | 1b7a965af8f1 |
30213322504433 has 2 divisors, whose sum is σ = 30213322504434. Its totient is φ = 30213322504432.
The previous prime is 30213322504429. The next prime is 30213322504441. The reversal of 30213322504433 is 33440522331203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29341213063009 + 872109441424 = 5416753^2 + 933868^2 .
It is a cyclic number.
It is not a de Polignac number, because 30213322504433 - 22 = 30213322504429 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 30213322504393 and 30213322504402.
It is not a weakly prime, because it can be changed into another prime (30213322504493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15106661252216 + 15106661252217.
It is an arithmetic number, because the mean of its divisors is an integer number (15106661252217).
Almost surely, 230213322504433 is an apocalyptic number.
It is an amenable number.
30213322504433 is a deficient number, since it is larger than the sum of its proper divisors (1).
30213322504433 is an equidigital number, since it uses as much as digits as its factorization.
30213322504433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 155520, while the sum is 35.
Adding to 30213322504433 its reverse (33440522331203), we get a palindrome (63653844835636).
The spelling of 30213322504433 in words is "thirty trillion, two hundred thirteen billion, three hundred twenty-two million, five hundred four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •