Base | Representation |
---|---|
bin | 10110101111001100010001… |
… | …000100110010100010010010 |
3 | 111010001220111122011122112020 |
4 | 112233030101010302202102 |
5 | 101101400010031133020 |
6 | 552403212001312310 |
7 | 30030522320260101 |
oct | 2657142104624222 |
9 | 433056448148466 |
10 | 100000010021010 |
11 | 29954847731100 |
12 | b270809035696 |
13 | 43a4c64244238 |
14 | 1a9a0522a0038 |
15 | b8636a5edc40 |
hex | 5af311132892 |
100000010021010 has 96 divisors (see below), whose sum is σ = 265259148912576. Its totient is φ = 24108490454400.
The previous prime is 100000010020991. The next prime is 100000010021083. The reversal of 100000010021010 is 10120010000001.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a self number, because there is not a number n which added to its sum of digits gives 100000010021010.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 75443004 + ... + 76757063.
It is an arithmetic number, because the mean of its divisors is an integer number (2763116134506).
Almost surely, 2100000010021010 is an apocalyptic number.
100000010021010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100000010021010 is an abundant number, since it is smaller than the sum of its proper divisors (165259138891566).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100000010021010 is a wasteful number, since it uses less digits than its factorization.
100000010021010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 152200280 (or 152200269 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 6.
Adding to 100000010021010 its reverse (10120010000001), we get a palindrome (110120020021011).
The spelling of 100000010021010 in words is "one hundred trillion, ten million, twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •