Base | Representation |
---|---|
bin | 100100000110001… |
… | …1100000010011010 |
3 | 10010102010100122112 |
4 | 1020030130002122 |
5 | 4440033020442 |
6 | 320104352322 |
7 | 42005126000 |
oct | 11014340232 |
9 | 3112110575 |
10 | 1211220122 |
11 | 57177a672 |
12 | 2997756a2 |
13 | 163c224c8 |
14 | b6c10a70 |
15 | 71505082 |
hex | 4831c09a |
1211220122 has 16 divisors (see below), whose sum is σ = 2118753600. Its totient is φ = 519094044.
The previous prime is 1211220121. The next prime is 1211220133. The reversal of 1211220122 is 2210221121.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 1211220097 and 1211220106.
It is not an unprimeable number, because it can be changed into a prime (1211220121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 882128 + ... + 883499.
It is an arithmetic number, because the mean of its divisors is an integer number (132422100).
Almost surely, 21211220122 is an apocalyptic number.
1211220122 is a deficient number, since it is larger than the sum of its proper divisors (907533478).
1211220122 is an equidigital number, since it uses as much as digits as its factorization.
1211220122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1765650 (or 1765636 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
The square root of 1211220122 is about 34802.5878635483. The cubic root of 1211220122 is about 1065.9602885471.
Adding to 1211220122 its reverse (2210221121), we get a palindrome (3421441243).
Subtracting 1211220122 from its reverse (2210221121), we obtain a palindrome (999000999).
The spelling of 1211220122 in words is "one billion, two hundred eleven million, two hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •