Base | Representation |
---|---|
bin | 1101101111010100000111… |
… | …10111011100110110001101 |
3 | 10221222100001202221100120011 |
4 | 12313222003313130312031 |
5 | 12430002222122431222 |
6 | 144131355524153221 |
7 | 6235550416225234 |
oct | 667520367346615 |
9 | 127870052840504 |
10 | 30213012311437 |
11 | 96992a288644a |
12 | 347b598838811 |
13 | 13b20c8550a97 |
14 | 7664636bdb1b |
15 | 375d9a7d2c77 |
hex | 1b7a83ddcd8d |
30213012311437 has 2 divisors, whose sum is σ = 30213012311438. Its totient is φ = 30213012311436.
The previous prime is 30213012311407. The next prime is 30213012311483. The reversal of 30213012311437 is 73411321031203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 27904742860036 + 2308269451401 = 5282494^2 + 1519299^2 .
It is a cyclic number.
It is not a de Polignac number, because 30213012311437 - 219 = 30213011787149 is a prime.
It is a super-2 number, since 2×302130123114372 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 30213012311399 and 30213012311408.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30213012311407) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15106506155718 + 15106506155719.
It is an arithmetic number, because the mean of its divisors is an integer number (15106506155719).
Almost surely, 230213012311437 is an apocalyptic number.
It is an amenable number.
30213012311437 is a deficient number, since it is larger than the sum of its proper divisors (1).
30213012311437 is an equidigital number, since it uses as much as digits as its factorization.
30213012311437 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 31.
The spelling of 30213012311437 in words is "thirty trillion, two hundred thirteen billion, twelve million, three hundred eleven thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •