Base | Representation |
---|---|
bin | 1001000111001111011111… |
… | …0011100011001010100010 |
3 | 1022110220102111200121110010 |
4 | 2101303313303203022202 |
5 | 2303132000413020002 |
6 | 33151044553145350 |
7 | 2052631316041143 |
oct | 221636763431242 |
9 | 38426374617403 |
10 | 10020021220002 |
11 | 3213515836a32 |
12 | 1159b449bb256 |
13 | 578b65052971 |
14 | 268d86179aca |
15 | 12599c9a146c |
hex | 91cf7ce32a2 |
10020021220002 has 8 divisors (see below), whose sum is σ = 20040042440016. Its totient is φ = 3340007073332.
The previous prime is 10020021219953. The next prime is 10020021220019. The reversal of 10020021220002 is 20002212002001.
It is a sphenic number, since it is the product of 3 distinct primes.
10020021220002 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 10020021220002.
It is an unprimeable number.
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, 835001768328 + ... + 835001768339.
It is an arithmetic number, because the mean of its divisors is an integer number (2505005305002).
Almost surely, 210020021220002 is an apocalyptic number.
10020021220002 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.
10020021220002 is a wasteful number, since it uses less digits than its factorization.
10020021220002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1670003536672.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 10020021220002 its reverse (20002212002001), we get a palindrome (30022233222003).
The spelling of 10020021220002 in words is "ten trillion, twenty billion, twenty-one million, two hundred twenty thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •