Base | Representation |
---|---|
bin | 11101000111100101000… |
… | …100101110010001100100 |
3 | 21002021221100012012102212 |
4 | 131013211010232101210 |
5 | 230241023232410340 |
6 | 4131125331022552 |
7 | 264365501655611 |
oct | 35074504562144 |
9 | 7067840165385 |
10 | 2001003013220 |
11 | 701691042532 |
12 | 283983a3aa58 |
13 | 1169032b7c13 |
14 | 6cbc5b83508 |
15 | 370b60a6a65 |
hex | 1d1e512e464 |
2001003013220 has 24 divisors (see below), whose sum is σ = 4202873505600. Its totient is φ = 800255076192.
The previous prime is 2001003013123. The next prime is 2001003013241. The reversal of 2001003013220 is 223103001002.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 2001003013195 and 2001003013204.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9020750 + ... + 9239909.
It is an arithmetic number, because the mean of its divisors is an integer number (175119729400).
Almost surely, 22001003013220 is an apocalyptic number.
2001003013220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2001003013220 is an abundant number, since it is smaller than the sum of its proper divisors (2201870492380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2001003013220 is a wasteful number, since it uses less digits than its factorization.
2001003013220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18266147 (or 18266145 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 2001003013220 its reverse (223103001002), we get a palindrome (2224106014222).
The spelling of 2001003013220 in words is "two trillion, one billion, three million, thirteen thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •