Base | Representation |
---|---|
bin | 101110100100010001… |
… | …0110000110010101110 |
3 | 100120010021010102002200 |
4 | 1131020202300302232 |
5 | 3114300314220420 |
6 | 113535011202330 |
7 | 10140061124136 |
oct | 1351042606256 |
9 | 316107112080 |
10 | 100001320110 |
11 | 394571579aa |
12 | 1746a2a63a6 |
13 | 9578b82583 |
14 | 4ba92c5ac6 |
15 | 29043eab90 |
hex | 17488b0cae |
100001320110 has 48 divisors (see below), whose sum is σ = 260039080080. Its totient is φ = 26663362560.
The previous prime is 100001320079. The next prime is 100001320127. The reversal of 100001320110 is 11023100001.
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 = 100001320092 and 100001320101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 618961 + ... + 763619.
It is an arithmetic number, because the mean of its divisors is an integer number (5417480835).
Almost surely, 2100001320110 is an apocalyptic number.
100001320110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100001320110 is an abundant number, since it is smaller than the sum of its proper divisors (160037759970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100001320110 is a wasteful number, since it uses less digits than its factorization.
100001320110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152353 (or 152350 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 100001320110 its reverse (11023100001), we get a palindrome (111024420111).
The spelling of 100001320110 in words is "one hundred billion, one million, three hundred twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •