Base | Representation |
---|---|
bin | 110000000001011111000… |
… | …101101001110111001101 |
3 | 102200111012202012012102212 |
4 | 300001133011221313031 |
5 | 413032131312413122 |
6 | 11004020415200205 |
7 | 460266205605335 |
oct | 60013705516715 |
9 | 12614182165385 |
10 | 3300130201037 |
11 | 1062639511a3a |
12 | 453706b16065 |
13 | 1ac27c617937 |
14 | b5a2744c0c5 |
15 | 5ac9d570ce2 |
hex | 3005f169dcd |
3300130201037 has 2 divisors, whose sum is σ = 3300130201038. Its totient is φ = 3300130201036.
The previous prime is 3300130201007. The next prime is 3300130201057. The reversal of 3300130201037 is 7301020310033.
It is a happy number.
3300130201037 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3119582542756 + 180547658281 = 1766234^2 + 424909^2 .
It is an emirp because it is prime and its reverse (7301020310033) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3300130201037 - 232 = 3295835233741 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3300130201007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1650065100518 + 1650065100519.
It is an arithmetic number, because the mean of its divisors is an integer number (1650065100519).
Almost surely, 23300130201037 is an apocalyptic number.
It is an amenable number.
3300130201037 is a deficient number, since it is larger than the sum of its proper divisors (1).
3300130201037 is an equidigital number, since it uses as much as digits as its factorization.
3300130201037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 23.
The spelling of 3300130201037 in words is "three trillion, three hundred billion, one hundred thirty million, two hundred one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •