Base | Representation |
---|---|
bin | 101111000010111101… |
… | …0110000110111010000 |
3 | 100122210000200200120220 |
4 | 1132011322300313100 |
5 | 3123402420201112 |
6 | 114225113233040 |
7 | 10204433342433 |
oct | 1360572606720 |
9 | 318700620526 |
10 | 101031022032 |
11 | 39935418226 |
12 | 176b7102780 |
13 | 96b12bbb55 |
14 | 4c65d6581a |
15 | 29649e798c |
hex | 1785eb0dd0 |
101031022032 has 80 divisors (see below), whose sum is σ = 277451116992. Its totient is φ = 31569664000.
The previous prime is 101031022003. The next prime is 101031022051. The reversal of 101031022032 is 230220130101.
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 15 ways as a sum of consecutive naturals, for example, 41823 + ... + 451454.
Almost surely, 2101031022032 is an apocalyptic number.
101031022032 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 101031022032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (138725558496).
101031022032 is an abundant number, since it is smaller than the sum of its proper divisors (176420094960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101031022032 is a wasteful number, since it uses less digits than its factorization.
101031022032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 493556 (or 493550 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 101031022032 its reverse (230220130101), we get a palindrome (331251152133).
The spelling of 101031022032 in words is "one hundred one billion, thirty-one million, twenty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •