Base | Representation |
---|---|
bin | 11101000111100110110… |
… | …011010110001000100010 |
3 | 21002022000100202111201200 |
4 | 131013212303112020202 |
5 | 230241103143343242 |
6 | 4131132244342030 |
7 | 264366303315240 |
oct | 35074663261042 |
9 | 7068010674650 |
10 | 2001032012322 |
11 | 7016a6449a32 |
12 | 2839916a4916 |
13 | 1169092cc455 |
14 | 6cbc9971790 |
15 | 370b88d404c |
hex | 1d1e6cd6222 |
2001032012322 has 48 divisors (see below), whose sum is σ = 4955026914240. Its totient is φ = 571712989536.
The previous prime is 2001032012261. The next prime is 2001032012333. The reversal of 2001032012322 is 2232102301002.
2001032012322 is a `hidden beast` number, since 2 + 0 + 0 + 10 + 320 + 12 + 322 = 666.
It is a super-2 number, since 2×20010320123222 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 2001032012295 and 2001032012304.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9120204 + ... + 9337032.
It is an arithmetic number, because the mean of its divisors is an integer number (103229727380).
Almost surely, 22001032012322 is an apocalyptic number.
2001032012322 is an abundant number, since it is smaller than the sum of its proper divisors (2953994901918).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2001032012322 is a wasteful number, since it uses less digits than its factorization.
2001032012322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 290087 (or 290084 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 2001032012322 its reverse (2232102301002), we get a palindrome (4233134313324).
The spelling of 2001032012322 in words is "two trillion, one billion, thirty-two million, twelve thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •