Base | Representation |
---|---|
bin | 1101110000011011001010… |
… | …01100110110111011011001 |
3 | 10222002222111211111110202101 |
4 | 12320031211030312323121 |
5 | 12431113330022112012 |
6 | 144201104305403401 |
7 | 6241400521616113 |
oct | 670154514667331 |
9 | 128088454443671 |
10 | 30251152535257 |
11 | 9703494a62085 |
12 | 3486a61939561 |
13 | 13b5896214164 |
14 | 768240c943b3 |
15 | 376d7dda4d57 |
hex | 1b8365336ed9 |
30251152535257 has 2 divisors, whose sum is σ = 30251152535258. Its totient is φ = 30251152535256.
The previous prime is 30251152535243. The next prime is 30251152535321. The reversal of 30251152535257 is 75253525115203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21119943774736 + 9131208760521 = 4595644^2 + 3021789^2 .
It is an emirp because it is prime and its reverse (75253525115203) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30251152535257 is a prime.
It is a super-2 number, since 2×302511525352572 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (30251152535057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15125576267628 + 15125576267629.
It is an arithmetic number, because the mean of its divisors is an integer number (15125576267629).
Almost surely, 230251152535257 is an apocalyptic number.
It is an amenable number.
30251152535257 is a deficient number, since it is larger than the sum of its proper divisors (1).
30251152535257 is an equidigital number, since it uses as much as digits as its factorization.
30251152535257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1575000, while the sum is 46.
The spelling of 30251152535257 in words is "thirty trillion, two hundred fifty-one billion, one hundred fifty-two million, five hundred thirty-five thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •