Base | Representation |
---|---|
bin | 10110101111001101010010… |
… | …101001010000100000101010 |
3 | 111010002000100022011110012220 |
4 | 112233031102221100200222 |
5 | 101101404233141200020 |
6 | 552403513100014510 |
7 | 30030561505632360 |
oct | 2657152251204052 |
9 | 433060308143186 |
10 | 100001110100010 |
11 | 2995526169a7a9 |
12 | b270a75531436 |
13 | 43a50ab121b62 |
14 | 1a9a11841d630 |
15 | b863d1e9d240 |
hex | 5af352a5082a |
100001110100010 has 32 divisors (see below), whose sum is σ = 274288759132032. Its totient is φ = 22857396594240.
The previous prime is 100001110099967. The next prime is 100001110100051. The reversal of 100001110100010 is 10001011100001.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 238097880981 + ... + 238097881400.
It is an arithmetic number, because the mean of its divisors is an integer number (8571523722876).
Almost surely, 2100001110100010 is an apocalyptic number.
100001110100010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100001110100010 is an abundant number, since it is smaller than the sum of its proper divisors (174287649032022).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100001110100010 is a wasteful number, since it uses less digits than its factorization.
100001110100010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 476195762398.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 100001110100010 its reverse (10001011100001), we get a palindrome (110002121200011).
Subtracting from 100001110100010 its reverse (10001011100001), we obtain a palindrome (90000099000009).
The spelling of 100001110100010 in words is "one hundred trillion, one billion, one hundred ten million, one hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.116 sec. • engine limits •