Base | Representation |
---|---|
bin | 1001000110000101010010… |
… | …0010001000110001110000 |
3 | 1022102000000022100110210211 |
4 | 2101201110202020301300 |
5 | 2302320202114200310 |
6 | 33133552233233504 |
7 | 2051324565234211 |
oct | 221412442106160 |
9 | 38360008313724 |
10 | 10000102100080 |
11 | 3206023a2a354 |
12 | 1156105b62894 |
13 | 57700c355b81 |
14 | 268016909408 |
15 | 1251d3daec8a |
hex | 91854888c70 |
10000102100080 has 20 divisors (see below), whose sum is σ = 23250237382872. Its totient is φ = 4000040840000.
The previous prime is 10000102100003. The next prime is 10000102100081. The reversal of 10000102100080 is 8000120100001.
It is a tau number, because it is divible by the number of its divisors (20).
It is a self number, because there is not a number n which added to its sum of digits gives 10000102100080.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10000102100081) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 62500638046 + ... + 62500638205.
Almost surely, 210000102100080 is an apocalyptic number.
10000102100080 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10000102100080 is an abundant number, since it is smaller than the sum of its proper divisors (13250135282792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10000102100080 is a wasteful number, since it uses less digits than its factorization.
10000102100080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125001276264 (or 125001276258 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 10000102100080 its reverse (8000120100001), we get a palindrome (18000222200081).
The spelling of 10000102100080 in words is "ten trillion, one hundred two million, one hundred thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •