Base | Representation |
---|---|
bin | 101111011010100011… |
… | …0100011111101000000 |
3 | 100201211012021020211020 |
4 | 1132311012203331000 |
5 | 3132013044102112 |
6 | 114435432345440 |
7 | 10233155123334 |
oct | 1366506437500 |
9 | 321735236736 |
10 | 101822644032 |
11 | 3a20125658a |
12 | 17898245280 |
13 | 97a92ca535 |
14 | 4cdd14d7c4 |
15 | 29ae26748c |
hex | 17b51a3f40 |
101822644032 has 168 divisors, whose sum is σ = 301250847840. Its totient is φ = 30262763520.
The previous prime is 101822644019. The next prime is 101822644087. The reversal of 101822644032 is 230446228101.
It is a junction number, because it is equal to n+sod(n) for n = 101822643984 and 101822644002.
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 23 ways as a sum of consecutive naturals, for example, 1005982 + ... + 1102562.
Almost surely, 2101822644032 is an apocalyptic number.
101822644032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101822644032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150625423920).
101822644032 is an abundant number, since it is smaller than the sum of its proper divisors (199428203808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101822644032 is a wasteful number, since it uses less digits than its factorization.
101822644032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96649 (or 96622 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 33.
The spelling of 101822644032 in words is "one hundred one billion, eight hundred twenty-two million, six hundred forty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •