Base | Representation |
---|---|
bin | 110000000001011000000… |
… | …011001101101111000111 |
3 | 102200110220112000010010022 |
4 | 300001120003031233013 |
5 | 413031411100333111 |
6 | 11004001000245355 |
7 | 460263243131633 |
oct | 60013003155707 |
9 | 12613815003108 |
10 | 3300012121031 |
11 | 10625888a175a |
12 | 45369347085b |
13 | 1ac261013902 |
14 | b5a158b1dc3 |
15 | 5ac92ee92db |
hex | 300580cdbc7 |
3300012121031 has 2 divisors, whose sum is σ = 3300012121032. Its totient is φ = 3300012121030.
The previous prime is 3300012121013. The next prime is 3300012121067. The reversal of 3300012121031 is 1301212100033.
Together with previous prime (3300012121013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is an emirp because it is prime and its reverse (1301212100033) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3300012121031 - 26 = 3300012120967 is a prime.
It is a super-2 number, since 2×33000121210312 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3300012121001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1650006060515 + 1650006060516.
It is an arithmetic number, because the mean of its divisors is an integer number (1650006060516).
Almost surely, 23300012121031 is an apocalyptic number.
3300012121031 is a deficient number, since it is larger than the sum of its proper divisors (1).
3300012121031 is an equidigital number, since it uses as much as digits as its factorization.
3300012121031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 3300012121031 its reverse (1301212100033), we get a palindrome (4601224221064).
The spelling of 3300012121031 in words is "three trillion, three hundred billion, twelve million, one hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •