Base | Representation |
---|---|
bin | 101111000010101100… |
… | …1001001100000110110 |
3 | 100122202102002222220010 |
4 | 1132011121021200312 |
5 | 3123343141210402 |
6 | 114224200321050 |
7 | 10204265421612 |
oct | 1360531114066 |
9 | 318672088803 |
10 | 101022210102 |
11 | 39930449740 |
12 | 176b4173186 |
13 | 96ac524ca8 |
14 | 4c64b10342 |
15 | 2963d56a6c |
hex | 1785649836 |
101022210102 has 64 divisors (see below), whose sum is σ = 222711441408. Its totient is φ = 30293760000.
The previous prime is 101022210097. The next prime is 101022210173. The reversal of 101022210102 is 201012220101.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 20908827 + ... + 20913657.
It is an arithmetic number, because the mean of its divisors is an integer number (3479866272).
Almost surely, 2101022210102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101022210102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (111355720704).
101022210102 is an abundant number, since it is smaller than the sum of its proper divisors (121689231306).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101022210102 is a wasteful number, since it uses less digits than its factorization.
101022210102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8085.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 101022210102 its reverse (201012220101), we get a palindrome (302034430203).
Subtracting 101022210102 from its reverse (201012220101), we obtain a palindrome (99990009999).
The spelling of 101022210102 in words is "one hundred one billion, twenty-two million, two hundred ten thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •