Base | Representation |
---|---|
bin | 1101101010000101011100… |
… | …00101111101000011010001 |
3 | 10221100011021112222101220111 |
4 | 12311002232011331003101 |
5 | 12414031231011130001 |
6 | 143513042230241321 |
7 | 6216556652666614 |
oct | 665025605750321 |
9 | 127304245871814 |
10 | 30033332130001 |
11 | 962a079024732 |
12 | 34507b21b6241 |
13 | 139b191c55cb5 |
14 | 75b89a17617b |
15 | 371381200851 |
hex | 1b50ae17d0d1 |
30033332130001 has 2 divisors, whose sum is σ = 30033332130002. Its totient is φ = 30033332130000.
The previous prime is 30033332129953. The next prime is 30033332130023. The reversal of 30033332130001 is 10003123333003.
It is an a-pointer prime, because the next prime (30033332130023) can be obtained adding 30033332130001 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29668981061776 + 364351068225 = 5446924^2 + 603615^2 .
It is a cyclic number.
It is not a de Polignac number, because 30033332130001 - 243 = 21237239107793 is a prime.
It is not a weakly prime, because it can be changed into another prime (30033332130041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15016666065000 + 15016666065001.
It is an arithmetic number, because the mean of its divisors is an integer number (15016666065001).
Almost surely, 230033332130001 is an apocalyptic number.
It is an amenable number.
30033332130001 is a deficient number, since it is larger than the sum of its proper divisors (1).
30033332130001 is an equidigital number, since it uses as much as digits as its factorization.
30033332130001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1458, while the sum is 22.
Adding to 30033332130001 its reverse (10003123333003), we get a palindrome (40036455463004).
The spelling of 30033332130001 in words is "thirty trillion, thirty-three billion, three hundred thirty-two million, one hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •