Base | Representation |
---|---|
bin | 1001000110001100010110… |
… | …1010111001001101011100 |
3 | 1022102011220121000000020101 |
4 | 2101203011222321031130 |
5 | 2302333044024033040 |
6 | 33134504440430444 |
7 | 2051422614056413 |
oct | 221430552711534 |
9 | 38364817000211 |
10 | 10002000221020 |
11 | 3206908411745 |
12 | 1156555778424 |
13 | 57725267c362 |
14 | 268156a4447a |
15 | 12529584b09a |
hex | 918c5ab935c |
10002000221020 has 24 divisors (see below), whose sum is σ = 21681755319168. Its totient is φ = 3871742020800.
The previous prime is 10002000220999. The next prime is 10002000221033. The reversal of 10002000221020 is 2012200020001.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 10002000220988 and 10002000221006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8066128591 + ... + 8066129830.
It is an arithmetic number, because the mean of its divisors is an integer number (903406471632).
Almost surely, 210002000221020 is an apocalyptic number.
10002000221020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10002000221020 is an abundant number, since it is smaller than the sum of its proper divisors (11679755098148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10002000221020 is a wasteful number, since it uses less digits than its factorization.
10002000221020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16132258461 (or 16132258459 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 10002000221020 its reverse (2012200020001), we get a palindrome (12014200241021).
The spelling of 10002000221020 in words is "ten trillion, two billion, two hundred twenty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •