Base | Representation |
---|---|
bin | 101110100100010110… |
… | …1011010001010100010 |
3 | 100120010110101012111100 |
4 | 1131020231122022202 |
5 | 3114302023023020 |
6 | 113535151055230 |
7 | 10140123626646 |
oct | 1351055321242 |
9 | 316113335440 |
10 | 100004111010 |
11 | 39458793831 |
12 | 1746b211516 |
13 | 957961b9ab |
14 | 4ba9810c26 |
15 | 290479ca90 |
hex | 1748b5a2a2 |
100004111010 has 24 divisors (see below), whose sum is σ = 260010688860. Its totient is φ = 26667762912.
The previous prime is 100004110991. The next prime is 100004111023. The reversal of 100004111010 is 10111400001.
It can be written as a sum of positive squares in 2 ways, for example, as 99071969049 + 932141961 = 314757^2 + 30531^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 = 100004110983 and 100004111001.
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 11 ways as a sum of consecutive naturals, for example, 555578305 + ... + 555578484.
Almost surely, 2100004111010 is an apocalyptic number.
100004111010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100004111010 is an abundant number, since it is smaller than the sum of its proper divisors (160006577850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100004111010 is a wasteful number, since it uses less digits than its factorization.
100004111010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1111156802 (or 1111156799 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 100004111010 its reverse (10111400001), we get a palindrome (110115511011).
The spelling of 100004111010 in words is "one hundred billion, four million, one hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •