Base | Representation |
---|---|
bin | 101110101010001110… |
… | …0111010000111001010 |
3 | 100120122012001220001200 |
4 | 1131110130322013022 |
5 | 3120202441041020 |
6 | 114010505325030 |
7 | 10145035253616 |
oct | 1352434720712 |
9 | 316565056050 |
10 | 100201112010 |
11 | 39549a0857a |
12 | 17505196776 |
13 | 95ab395c2c |
14 | 4bc7a52346 |
15 | 2916c13590 |
hex | 175473a1ca |
100201112010 has 24 divisors (see below), whose sum is σ = 260522891460. Its totient is φ = 26720296512.
The previous prime is 100201111987. The next prime is 100201112051. The reversal of 100201112010 is 10211102001.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 95164229169 + 5036882841 = 308487^2 + 70971^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 100201111983 and 100201112001.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 556672755 + ... + 556672934.
Almost surely, 2100201112010 is an apocalyptic number.
100201112010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100201112010 is an abundant number, since it is smaller than the sum of its proper divisors (160321779450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100201112010 is a wasteful number, since it uses less digits than its factorization.
100201112010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1113345702 (or 1113345699 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 100201112010 its reverse (10211102001), we get a palindrome (110412214011).
The spelling of 100201112010 in words is "one hundred billion, two hundred one million, one hundred twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •