Base | Representation |
---|---|
bin | 11101000110101111111… |
… | …010110011100100001010 |
3 | 21002012122012010110111110 |
4 | 131012233322303210022 |
5 | 230232211433033002 |
6 | 4130501032511150 |
7 | 264334422603366 |
oct | 35065772634412 |
9 | 7065565113443 |
10 | 2000111221002 |
11 | 701273706874 |
12 | 28377524b4b6 |
13 | 1167c060640b |
14 | 6cb3d5622a6 |
15 | 37062b4be6c |
hex | 1d1afeb390a |
2000111221002 has 8 divisors (see below), whose sum is σ = 4000222442016. Its totient is φ = 666703740332.
The previous prime is 2000111220983. The next prime is 2000111221007. The reversal of 2000111221002 is 2001221110002.
It is a sphenic number, since it is the product of 3 distinct primes.
2000111221002 is an admirable number.
It is a super-2 number, since 2×20001112210022 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2000111221007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 166675935078 + ... + 166675935089.
It is an arithmetic number, because the mean of its divisors is an integer number (500027805252).
Almost surely, 22000111221002 is an apocalyptic number.
2000111221002 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000111221002 is a wasteful number, since it uses less digits than its factorization.
2000111221002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333351870172.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2000111221002 its reverse (2001221110002), we get a palindrome (4001332331004).
The spelling of 2000111221002 in words is "two trillion, one hundred eleven million, two hundred twenty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •