Base | Representation |
---|---|
bin | 1100000100010… |
… | …00011010000110 |
3 | 21001110121111210 |
4 | 12002020122012 |
5 | 201403101042 |
6 | 14013312250 |
7 | 2336241636 |
oct | 602103206 |
9 | 231417453 |
10 | 101222022 |
11 | 52156670 |
12 | 29a95686 |
13 | 17c80ab5 |
14 | d62c6c6 |
15 | 8d46a9c |
hex | 6088686 |
101222022 has 48 divisors (see below), whose sum is σ = 224517312. Its totient is φ = 30170880.
The previous prime is 101222021. The next prime is 101222041. The reversal of 101222022 is 220222101.
It is a junction number, because it is equal to n+sod(n) for n = 101221989 and 101222007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101222021) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 620913 + ... + 621075.
It is an arithmetic number, because the mean of its divisors is an integer number (4677444).
Almost surely, 2101222022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101222022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (112258656).
101222022 is an abundant number, since it is smaller than the sum of its proper divisors (123295290).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101222022 is a wasteful number, since it uses less digits than its factorization.
101222022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373 (or 276 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
The square root of 101222022 is about 10060.9155646989. The cubic root of 101222022 is about 466.0419414932.
Adding to 101222022 its reverse (220222101), we get a palindrome (321444123).
The spelling of 101222022 in words is "one hundred one million, two hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •