Base | Representation |
---|---|
bin | 1001000111001111011110… |
… | …1111010001101110100000 |
3 | 1022110220102102120201002120 |
4 | 2101303313233101232200 |
5 | 2303132000121200000 |
6 | 33151044513144240 |
7 | 2052631303364631 |
oct | 221636757215640 |
9 | 38426372521076 |
10 | 10020020100000 |
11 | 3213515141509 |
12 | 1159b4455b080 |
13 | 578b64a4cc41 |
14 | 268d85d67888 |
15 | 12599c82e6a0 |
hex | 91cf7bd1ba0 |
10020020100000 has 144 divisors (see below), whose sum is σ = 32876087733216. Its totient is φ = 2672005280000.
The previous prime is 10020020099977. The next prime is 10020020100017. The reversal of 10020020100000 is 102002001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 16400034 + ... + 17000033.
It is an arithmetic number, because the mean of its divisors is an integer number (228306164814).
Almost surely, 210020020100000 is an apocalyptic number.
10020020100000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10020020100000 is an abundant number, since it is smaller than the sum of its proper divisors (22856067633216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10020020100000 is an frugal number, since it uses more digits than its factorization.
10020020100000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33400105 (or 33400077 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 6.
Adding to 10020020100000 its reverse (102002001), we get a palindrome (10020122102001).
The spelling of 10020020100000 in words is "ten trillion, twenty billion, twenty million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •