Base | Representation |
---|---|
bin | 101110100100010110… |
… | …1110011011000100110 |
3 | 100120010110120110012021 |
4 | 1131020231303120212 |
5 | 3114302034324220 |
6 | 113535153213354 |
7 | 10140124540060 |
oct | 1351055633046 |
9 | 316113513167 |
10 | 100004214310 |
11 | 39458854400 |
12 | 1746b26125a |
13 | 9579656a10 |
14 | 4ba983a730 |
15 | 29047bd4aa |
hex | 1748b73626 |
100004214310 has 96 divisors (see below), whose sum is σ = 243519748416. Its totient is φ = 28772409600.
The previous prime is 100004214287. The next prime is 100004214313. The reversal of 100004214310 is 13412400001.
It is a super-2 number, since 2×1000042143102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100004214313) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 344001 + ... + 564220.
It is an arithmetic number, because the mean of its divisors is an integer number (2536664046).
Almost surely, 2100004214310 is an apocalyptic number.
100004214310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100004214310 is an abundant number, since it is smaller than the sum of its proper divisors (143515534106).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100004214310 is a wasteful number, since it uses less digits than its factorization.
100004214310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 908270 (or 908259 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 100004214310 its reverse (13412400001), we get a palindrome (113416614311).
The spelling of 100004214310 in words is "one hundred billion, four million, two hundred fourteen thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •