Base | Representation |
---|---|
bin | 101110100100001111… |
… | …0001110010000111110 |
3 | 100120010011212221201121 |
4 | 1131020132032100332 |
5 | 3114300013130420 |
6 | 113534525501154 |
7 | 10140045036556 |
oct | 1351036162076 |
9 | 316104787647 |
10 | 100000130110 |
11 | 39456514931 |
12 | 17469a117ba |
13 | 9578856a2a |
14 | 4ba9096166 |
15 | 29042632aa |
hex | 174878e43e |
100000130110 has 8 divisors (see below), whose sum is σ = 180000234216. Its totient is φ = 40000052040.
The previous prime is 100000130107. The next prime is 100000130123. The reversal of 100000130110 is 11031000001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1000001301102 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 100000130093 and 100000130102.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 5000006496 + ... + 5000006515.
It is an arithmetic number, because the mean of its divisors is an integer number (22500029277).
Almost surely, 2100000130110 is an apocalyptic number.
100000130110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100000130110 is a deficient number, since it is larger than the sum of its proper divisors (80000104106).
100000130110 is a wasteful number, since it uses less digits than its factorization.
100000130110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10000013018.
The product of its (nonzero) digits is 3, while the sum is 7.
Adding to 100000130110 its reverse (11031000001), we get a palindrome (111031130111).
The spelling of 100000130110 in words is "one hundred billion, one hundred thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •