Base | Representation |
---|---|
bin | 11101010000010000100… |
… | …001110101110010001001 |
3 | 21010011222210111211110122 |
4 | 131100100201311302021 |
5 | 230414114413013113 |
6 | 4135310145153025 |
7 | 265145440031363 |
oct | 35202041656211 |
9 | 7104883454418 |
10 | 2010322001033 |
11 | 7056333a6a55 |
12 | 28574492b775 |
13 | 117759b837a8 |
14 | 6d42b6b1d33 |
15 | 3745e293408 |
hex | 1d410875c89 |
2010322001033 has 4 divisors (see below), whose sum is σ = 2116128422160. Its totient is φ = 1904515579908.
The previous prime is 2010322001011. The next prime is 2010322001057. The reversal of 2010322001033 is 3301002230102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2010322001033 - 212 = 2010321996937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2010322007033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52903210535 + ... + 52903210572.
It is an arithmetic number, because the mean of its divisors is an integer number (529032105540).
Almost surely, 22010322001033 is an apocalyptic number.
It is an amenable number.
2010322001033 is a deficient number, since it is larger than the sum of its proper divisors (105806421127).
2010322001033 is a wasteful number, since it uses less digits than its factorization.
2010322001033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105806421126.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 2010322001033 its reverse (3301002230102), we get a palindrome (5311324231135).
The spelling of 2010322001033 in words is "two trillion, ten billion, three hundred twenty-two million, one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •