Base | Representation |
---|---|
bin | 111100111011000… |
… | …101100001110110 |
3 | 2122020022011221011 |
4 | 330323011201312 |
5 | 4043130401402 |
6 | 245231342434 |
7 | 34220615551 |
oct | 7473054166 |
9 | 2566264834 |
10 | 1022122102 |
11 | 484a63511 |
12 | 246381a1a |
13 | 1339b44a1 |
14 | 99a69698 |
15 | 5eb00ed7 |
hex | 3cec5876 |
1022122102 has 8 divisors (see below), whose sum is σ = 1550410200. Its totient is φ = 505318704.
The previous prime is 1022122099. The next prime is 1022122109. The reversal of 1022122102 is 2012212201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022122109) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 2870952 + ... + 2871307.
It is an arithmetic number, because the mean of its divisors is an integer number (193801275).
Almost surely, 21022122102 is an apocalyptic number.
1022122102 is a deficient number, since it is larger than the sum of its proper divisors (528288098).
1022122102 is an equidigital number, since it uses as much as digits as its factorization.
1022122102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5742350.
The product of its (nonzero) digits is 32, while the sum is 13.
The square root of 1022122102 is about 31970.6443788673. The cubic root of 1022122102 is about 1007.3203162125.
Adding to 1022122102 its reverse (2012212201), we get a palindrome (3034334303).
Subtracting 1022122102 from its reverse (2012212201), we obtain a palindrome (990090099).
It can be divided in two parts, 10221 and 22102, that added together give a palindrome (32323).
The spelling of 1022122102 in words is "one billion, twenty-two million, one hundred twenty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •