Base | Representation |
---|---|
bin | 1001000110001100110001… |
… | …1001111111010011000100 |
3 | 1022102012012110122110102220 |
4 | 2101203030121333103010 |
5 | 2302333311441330040 |
6 | 33134523554532340 |
7 | 2051425455452622 |
oct | 221431431772304 |
9 | 38365173573386 |
10 | 10002113230020 |
11 | 320696618900a |
12 | 11565875970b0 |
13 | 57726cbc91a2 |
14 | 268167a60512 |
15 | 1252a07202d0 |
hex | 918cc67f4c4 |
10002113230020 has 48 divisors (see below), whose sum is σ = 28688988198528. Its totient is φ = 2602175799040.
The previous prime is 10002113230013. The next prime is 10002113230037. The reversal of 10002113230020 is 2003231120001.
It is a super-2 number, since 2×100021132300202 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2032947384 + ... + 2032952303.
It is an arithmetic number, because the mean of its divisors is an integer number (597687254136).
Almost surely, 210002113230020 is an apocalyptic number.
10002113230020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10002113230020 is an abundant number, since it is smaller than the sum of its proper divisors (18686874968508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10002113230020 is a wasteful number, since it uses less digits than its factorization.
10002113230020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4065899740 (or 4065899738 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 10002113230020 its reverse (2003231120001), we get a palindrome (12005344350021).
The spelling of 10002113230020 in words is "ten trillion, two billion, one hundred thirteen million, two hundred thirty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •