Base | Representation |
---|---|
bin | 10110101111001110000111… |
… | …101111110100000101000010 |
3 | 111010002002122101120102100121 |
4 | 112233032013233310011002 |
5 | 101101413044224323020 |
6 | 552404141323210454 |
7 | 30030622544354500 |
oct | 2657160757640502 |
9 | 433062571512317 |
10 | 100002001011010 |
11 | 2995567958438a |
12 | b271083976a2a |
13 | 43a51c0885527 |
14 | 1a9a1a0891670 |
15 | b864352d1baa |
hex | 5af387bf4142 |
100002001011010 has 48 divisors (see below), whose sum is σ = 209503503611064. Its totient is φ = 34268133435648.
The previous prime is 100002001010993. The next prime is 100002001011043. The reversal of 100002001011010 is 10110100200001.
It can be written as a sum of positive squares in 4 ways, for example, as 99823897598481 + 178103412529 = 9991191^2 + 422023^2 .
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a junction number, because it is equal to n+sod(n) for n = 100002001010984 and 100002001011002.
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, 53445139 + ... + 55284598.
Almost surely, 2100002001011010 is an apocalyptic number.
100002001011010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100002001011010 is an abundant number, since it is smaller than the sum of its proper divisors (109501502600054).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100002001011010 is a wasteful number, since it uses less digits than its factorization.
100002001011010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108731635 (or 108731628 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 100002001011010 its reverse (10110100200001), we get a palindrome (110112101211011).
The spelling of 100002001011010 in words is "one hundred trillion, two billion, one million, eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •