Base | Representation |
---|---|
bin | 1101101111010000100100… |
… | …11111100000101101001001 |
3 | 10221222011011012210121102202 |
4 | 12313220102133200231021 |
5 | 12424434323203213002 |
6 | 144130443055405545 |
7 | 6235452321515135 |
oct | 667502237405511 |
9 | 127864135717382 |
10 | 30211110210377 |
11 | 96985071257a8 |
12 | 347b1478238b5 |
13 | 13b1b84462ab5 |
14 | 766322c2a3c5 |
15 | 375cd880c502 |
hex | 1b7a127e0b49 |
30211110210377 has 2 divisors, whose sum is σ = 30211110210378. Its totient is φ = 30211110210376.
The previous prime is 30211110210301. The next prime is 30211110210397. The reversal of 30211110210377 is 77301201111203.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 23904462429961 + 6306647780416 = 4889219^2 + 2511304^2 .
It is a cyclic number.
It is not a de Polignac number, because 30211110210377 - 28 = 30211110210121 is a prime.
It is a super-2 number, since 2×302111102103772 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30211110210397) 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, 15105555105188 + 15105555105189.
It is an arithmetic number, because the mean of its divisors is an integer number (15105555105189).
Almost surely, 230211110210377 is an apocalyptic number.
It is an amenable number.
30211110210377 is a deficient number, since it is larger than the sum of its proper divisors (1).
30211110210377 is an equidigital number, since it uses as much as digits as its factorization.
30211110210377 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1764, while the sum is 29.
The spelling of 30211110210377 in words is "thirty trillion, two hundred eleven billion, one hundred ten million, two hundred ten thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •