Base | Representation |
---|---|
bin | 111100111011000… |
… | …011000101100110 |
3 | 2122020021200012210 |
4 | 330323003011212 |
5 | 4043130041402 |
6 | 245231224250 |
7 | 34220544444 |
oct | 7473030546 |
9 | 2566250183 |
10 | 1022112102 |
11 | 484a56a50 |
12 | 246378086 |
13 | 1339aca7b |
14 | 99a65b94 |
15 | 5eaed06c |
hex | 3cec3166 |
1022112102 has 64 divisors (see below), whose sum is σ = 2320856064. Its totient is φ = 297373440.
The previous prime is 1022112061. The next prime is 1022112103. The reversal of 1022112102 is 2012112201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022112103) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 161298 + ... + 167514.
It is an arithmetic number, because the mean of its divisors is an integer number (36263376).
Almost surely, 21022112102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1022112102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1160428032).
1022112102 is an abundant number, since it is smaller than the sum of its proper divisors (1298743962).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022112102 is a wasteful number, since it uses less digits than its factorization.
1022112102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6333.
The product of its (nonzero) digits is 16, while the sum is 12.
The square root of 1022112102 is about 31970.4879850152. The cubic root of 1022112102 is about 1007.3170311399.
Adding to 1022112102 its reverse (2012112201), we get a palindrome (3034224303).
Subtracting 1022112102 from its reverse (2012112201), we obtain a palindrome (990000099).
The spelling of 1022112102 in words is "one billion, twenty-two million, one hundred twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •