Base | Representation |
---|---|
bin | 101111000011010110… |
… | …0010001111001111110 |
3 | 100122210221010011100101 |
4 | 1132012230101321332 |
5 | 3123414231034210 |
6 | 114230255351314 |
7 | 10204651564240 |
oct | 1360654217176 |
9 | 318727104311 |
10 | 101044002430 |
11 | 39941783628 |
12 | 176bb52253a |
13 | 96b3bb5167 |
14 | 4c67984090 |
15 | 2965c0da3a |
hex | 1786b11e7e |
101044002430 has 32 divisors (see below), whose sum is σ = 210197488320. Its totient is φ = 34254401280.
The previous prime is 101044002421. The next prime is 101044002439. The reversal of 101044002430 is 34200440101.
It is an interprime number because it is at equal distance from previous prime (101044002421) and next prime (101044002439).
It is a junction number, because it is equal to n+sod(n) for n = 101044002398 and 101044002407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101044002439) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8103241 + ... + 8115700.
It is an arithmetic number, because the mean of its divisors is an integer number (6568671510).
Almost surely, 2101044002430 is an apocalyptic number.
101044002430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101044002430 is an abundant number, since it is smaller than the sum of its proper divisors (109153485890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101044002430 is a wasteful number, since it uses less digits than its factorization.
101044002430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16219044.
The product of its (nonzero) digits is 384, while the sum is 19.
Adding to 101044002430 its reverse (34200440101), we get a palindrome (135244442531).
The spelling of 101044002430 in words is "one hundred one billion, forty-four million, two thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •