Base | Representation |
---|---|
bin | 100001001001000… |
… | …0001100000011110 |
3 | 2212111110112001210 |
4 | 1002102001200132 |
5 | 4234134133042 |
6 | 302202245250 |
7 | 36362010540 |
oct | 10222014036 |
9 | 2774415053 |
10 | 1112021022 |
11 | 520785942 |
12 | 2704b6826 |
13 | 1494cc408 |
14 | a798b690 |
15 | 6795ca9c |
hex | 4248181e |
1112021022 has 64 divisors (see below), whose sum is σ = 2624371200. Its totient is φ = 307528704.
The previous prime is 1112021021. The next prime is 1112021039. The reversal of 1112021022 is 2201202111.
It is a junction number, because it is equal to n+sod(n) for n = 1112020989 and 1112021007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112021021) 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, 201354 + ... + 206802.
It is an arithmetic number, because the mean of its divisors is an integer number (41005800).
Almost surely, 21112021022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1112021022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1312185600).
1112021022 is an abundant number, since it is smaller than the sum of its proper divisors (1512350178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112021022 is a wasteful number, since it uses less digits than its factorization.
1112021022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5617.
The product of its (nonzero) digits is 16, while the sum is 12.
The square root of 1112021022 is about 33346.9792035201. The cubic root of 1112021022 is about 1036.0268219777.
Adding to 1112021022 its reverse (2201202111), we get a palindrome (3313223133).
The spelling of 1112021022 in words is "one billion, one hundred twelve million, twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •