Base | Representation |
---|---|
bin | 10011000010010110… |
… | …00010111011011010 |
3 | 222101021010222100012 |
4 | 21201023002323122 |
5 | 131412334020442 |
6 | 4410050441522 |
7 | 511160303060 |
oct | 114113027332 |
9 | 28337128305 |
10 | 10220220122 |
11 | 4375058712 |
12 | 1b928932a2 |
13 | c6b504138 |
14 | 6cd4ca030 |
15 | 3ec3ad582 |
hex | 2612c2eda |
10220220122 has 8 divisors (see below), whose sum is σ = 17520377376. Its totient is φ = 4380094332.
The previous prime is 10220220121. The next prime is 10220220161. The reversal of 10220220122 is 22102202201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 730015723 = 10220220122 / (1 + 0 + 2 + 2 + 0 + 2 + 2 + 0 + 1 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 10220220097 and 10220220106.
It is not an unprimeable number, because it can be changed into a prime (10220220121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 365007848 + ... + 365007875.
It is an arithmetic number, because the mean of its divisors is an integer number (2190047172).
Almost surely, 210220220122 is an apocalyptic number.
10220220122 is a deficient number, since it is larger than the sum of its proper divisors (7300157254).
10220220122 is an equidigital number, since it uses as much as digits as its factorization.
10220220122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 730015732.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 10220220122 its reverse (22102202201), we get a palindrome (32322422323).
It can be divided in two parts, 102202201 and 22, that multiplied together give a palindrome (2248448422).
The spelling of 10220220122 in words is "ten billion, two hundred twenty million, two hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •