Base | Representation |
---|---|
bin | 10110101111001100010110… |
… | …100100100000110101101010 |
3 | 111010001220202001200000011112 |
4 | 112233030112210200311222 |
5 | 101101400202132120320 |
6 | 552403225053430322 |
7 | 30030524520054140 |
oct | 2657142644406552 |
9 | 433056661600145 |
10 | 100000102223210 |
11 | 29954894786a72 |
12 | b270833a9b3a2 |
13 | 43a4c7a387657 |
14 | 1a9a060621590 |
15 | b86373762ec5 |
hex | 5af316920d6a |
100000102223210 has 64 divisors (see below), whose sum is σ = 214055389228032. Its totient is φ = 32923128166656.
The previous prime is 100000102223089. The next prime is 100000102223237. The reversal of 100000102223210 is 12322201000001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 286572497 + ... + 286921236.
It is an arithmetic number, because the mean of its divisors is an integer number (3344615456688).
Almost surely, 2100000102223210 is an apocalyptic number.
100000102223210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100000102223210 is an abundant number, since it is smaller than the sum of its proper divisors (114055287004822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100000102223210 is a wasteful number, since it uses less digits than its factorization.
100000102223210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 573493847.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 100000102223210 its reverse (12322201000001), we get a palindrome (112322303223211).
The spelling of 100000102223210 in words is "one hundred trillion, one hundred two million, two hundred twenty-three thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •