Base | Representation |
---|---|
bin | 101011110011011110100… |
… | …111100001110011000001 |
3 | 101122202212211222012021012 |
4 | 223303132213201303001 |
5 | 343304403233324301 |
6 | 10222512230210305 |
7 | 430323600630353 |
oct | 53633647416301 |
9 | 11582784865235 |
10 | 3010212011201 |
11 | a6069522795a |
12 | 407495ab3995 |
13 | 18ab2841b795 |
14 | a59a32870d3 |
15 | 5348102eebb |
hex | 2bcde9e1cc1 |
3010212011201 has 2 divisors, whose sum is σ = 3010212011202. Its totient is φ = 3010212011200.
The previous prime is 3010212011189. The next prime is 3010212011267. The reversal of 3010212011201 is 1021102120103.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1539932083600 + 1470279927601 = 1240940^2 + 1212551^2 .
It is a cyclic number.
It is not a de Polignac number, because 3010212011201 - 26 = 3010212011137 is a prime.
It is a super-2 number, since 2×30102120112012 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3010212011291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1505106005600 + 1505106005601.
It is an arithmetic number, because the mean of its divisors is an integer number (1505106005601).
Almost surely, 23010212011201 is an apocalyptic number.
It is an amenable number.
3010212011201 is a deficient number, since it is larger than the sum of its proper divisors (1).
3010212011201 is an equidigital number, since it uses as much as digits as its factorization.
3010212011201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 3010212011201 its reverse (1021102120103), we get a palindrome (4031314131304).
The spelling of 3010212011201 in words is "three trillion, ten billion, two hundred twelve million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •