Base | Representation |
---|---|
bin | 101111000010010110… |
… | …0111101001000110000 |
3 | 100122201121022102012221 |
4 | 1132010230331020300 |
5 | 3123332210000242 |
6 | 114223104130424 |
7 | 10204065101200 |
oct | 1360454751060 |
9 | 318647272187 |
10 | 101010625072 |
11 | 39924956735 |
12 | 176b0306a14 |
13 | 96a9cc9b46 |
14 | 4c63376400 |
15 | 2962d19167 |
hex | 1784b3d230 |
101010625072 has 240 divisors, whose sum is σ = 246865449600. Its totient is φ = 39789066240.
The previous prime is 101010625057. The next prime is 101010625073. The reversal of 101010625072 is 270526010101.
It is not an unprimeable number, because it can be changed into a prime (101010625073) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 114654072 + ... + 114654952.
It is an arithmetic number, because the mean of its divisors is an integer number (1028606040).
Almost surely, 2101010625072 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 101010625072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (123432724800).
101010625072 is an abundant number, since it is smaller than the sum of its proper divisors (145854824528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101010625072 is a wasteful number, since it uses less digits than its factorization.
101010625072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1144 (or 1131 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 25.
Adding to 101010625072 its reverse (270526010101), we get a palindrome (371536635173).
The spelling of 101010625072 in words is "one hundred one billion, ten million, six hundred twenty-five thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •