Base | Representation |
---|---|
bin | 101101010010011111100… |
… | …011111110010101010001 |
3 | 102000112012220002011122011 |
4 | 231102133203332111101 |
5 | 401442323213030001 |
6 | 10341423521142521 |
7 | 440565020551525 |
oct | 55223743762521 |
9 | 12015186064564 |
10 | 3112233330001 |
11 | a9a988640764 |
12 | 42320878aa41 |
13 | 19763692b043 |
14 | aa8c0951d85 |
15 | 55e5293dd51 |
hex | 2d49f8fe551 |
3112233330001 has 2 divisors, whose sum is σ = 3112233330002. Its totient is φ = 3112233330000.
The previous prime is 3112233329999. The next prime is 3112233330103. The reversal of 3112233330001 is 1000333322113.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2512228170001 + 600005160000 = 1585001^2 + 774600^2 .
It is a cyclic number.
It is not a de Polignac number, because 3112233330001 - 21 = 3112233329999 is a prime.
It is a super-2 number, since 2×31122333300012 (a number of 26 digits) contains 22 as substring.
Together with 3112233329999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (3112233330601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1556116665000 + 1556116665001.
It is an arithmetic number, because the mean of its divisors is an integer number (1556116665001).
Almost surely, 23112233330001 is an apocalyptic number.
It is an amenable number.
3112233330001 is a deficient number, since it is larger than the sum of its proper divisors (1).
3112233330001 is an equidigital number, since it uses as much as digits as its factorization.
3112233330001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 3112233330001 its reverse (1000333322113), we get a palindrome (4112566652114).
The spelling of 3112233330001 in words is "three trillion, one hundred twelve billion, two hundred thirty-three million, three hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •