Base | Representation |
---|---|
bin | 1101101111011011001100… |
… | …01111011011100010110001 |
3 | 10221222200212110102112120222 |
4 | 12313231212033123202301 |
5 | 12430033011410421434 |
6 | 144133224435142425 |
7 | 6236043504162533 |
oct | 667554617334261 |
9 | 127880773375528 |
10 | 30216810248369 |
11 | 969a9716a86a8 |
12 | 3480278744a15 |
13 | 13b2582345144 |
14 | 766703c75853 |
15 | 37601de4272e |
hex | 1b7b663db8b1 |
30216810248369 has 2 divisors, whose sum is σ = 30216810248370. Its totient is φ = 30216810248368.
The previous prime is 30216810248323. The next prime is 30216810248381. The reversal of 30216810248369 is 96384201861203.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18945884119969 + 11270926128400 = 4352687^2 + 3357220^2 .
It is a cyclic number.
It is not a de Polignac number, because 30216810248369 - 240 = 29117298620593 is a prime.
It is a super-2 number, since 2×302168102483692 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 30216810248369.
It is not a weakly prime, because it can be changed into another prime (30216810248969) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15108405124184 + 15108405124185.
It is an arithmetic number, because the mean of its divisors is an integer number (15108405124185).
Almost surely, 230216810248369 is an apocalyptic number.
It is an amenable number.
30216810248369 is a deficient number, since it is larger than the sum of its proper divisors (1).
30216810248369 is an equidigital number, since it uses as much as digits as its factorization.
30216810248369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2985984, while the sum is 53.
The spelling of 30216810248369 in words is "thirty trillion, two hundred sixteen billion, eight hundred ten million, two hundred forty-eight thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •