Base | Representation |
---|---|
bin | 101111001001010110… |
… | …1011011111000100000 |
3 | 100200022222112000011102 |
4 | 1132102231123320200 |
5 | 3124322340211112 |
6 | 114302301133532 |
7 | 10212650446526 |
oct | 1362255337040 |
9 | 320288460142 |
10 | 101245632032 |
11 | 39a35579966 |
12 | 17756b5a2a8 |
13 | 97168c010c |
14 | 4c8666c316 |
15 | 297878abc2 |
hex | 1792b5be20 |
101245632032 has 48 divisors (see below), whose sum is σ = 203432727960. Its totient is φ = 49583419392.
The previous prime is 101245631989. The next prime is 101245632053. The reversal of 101245632032 is 230236542101.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 100968875536 + 276756496 = 317756^2 + 16636^2 .
It is a junction number, because it is equal to n+sod(n) for n = 101245631986 and 101245632004.
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 7 ways as a sum of consecutive naturals, for example, 955394 + ... + 1056062.
Almost surely, 2101245632032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101245632032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (101716363980).
101245632032 is an abundant number, since it is smaller than the sum of its proper divisors (102187095928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101245632032 is a wasteful number, since it uses less digits than its factorization.
101245632032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101325 (or 101317 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 29.
The spelling of 101245632032 in words is "one hundred one billion, two hundred forty-five million, six hundred thirty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •