Base | Representation |
---|---|
bin | 101111000010000100… |
… | …1000000011001000110 |
3 | 100122200221120122010110 |
4 | 1132010021000121012 |
5 | 3123322301414342 |
6 | 114222130133450 |
7 | 10203622021335 |
oct | 1360411003106 |
9 | 318627518113 |
10 | 101001201222 |
11 | 3991a5aa429 |
12 | 176a9121286 |
13 | 96a807a5bc |
14 | 4c62001d1c |
15 | 29620a6c9c |
hex | 1784240646 |
101001201222 has 32 divisors (see below), whose sum is σ = 204890457600. Its totient is φ = 33187104288.
The previous prime is 101001201211. The next prime is 101001201229. The reversal of 101001201222 is 222102100101.
101001201222 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 101001201198 and 101001201207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101001201229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 121288 + ... + 465524.
It is an arithmetic number, because the mean of its divisors is an integer number (6402826800).
Almost surely, 2101001201222 is an apocalyptic number.
101001201222 is an abundant number, since it is smaller than the sum of its proper divisors (103889256378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101001201222 is a wasteful number, since it uses less digits than its factorization.
101001201222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 344940.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 101001201222 its reverse (222102100101), we get a palindrome (323103301323).
The spelling of 101001201222 in words is "one hundred one billion, one million, two hundred one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •