Base | Representation |
---|---|
bin | 100000000001110110011… |
… | …011010011000100011001 |
3 | 21210102012011212002202200 |
4 | 200001312123103010121 |
5 | 242030132042414113 |
6 | 4403044033320413 |
7 | 315006040234131 |
oct | 40016633230431 |
9 | 7712164762680 |
10 | 2201010123033 |
11 | 77949691a407 |
12 | 2b66a1a06109 |
13 | 12c728c26287 |
14 | 7875ab95ac1 |
15 | 3c3bee82873 |
hex | 200766d3119 |
2201010123033 has 12 divisors (see below), whose sum is σ = 3253172585520. Its totient is φ = 1433215893816.
The previous prime is 2201010123029. The next prime is 2201010123079. The reversal of 2201010123033 is 3303210101022.
It is not a de Polignac number, because 2201010123033 - 22 = 2201010123029 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2201010122997 and 2201010123015.
It is not an unprimeable number, because it can be changed into a prime (2201010123833) 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 11 ways as a sum of consecutive naturals, for example, 2843681943 + ... + 2843682716.
It is an arithmetic number, because the mean of its divisors is an integer number (271097715460).
Almost surely, 22201010123033 is an apocalyptic number.
It is an amenable number.
2201010123033 is a deficient number, since it is larger than the sum of its proper divisors (1052162462487).
2201010123033 is a wasteful number, since it uses less digits than its factorization.
2201010123033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5687364708 (or 5687364705 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 2201010123033 its reverse (3303210101022), we get a palindrome (5504220224055).
The spelling of 2201010123033 in words is "two trillion, two hundred one billion, ten million, one hundred twenty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •