Base | Representation |
---|---|
bin | 11011010010001111110101… |
… | …100011100011001011110110 |
3 | 120201220000002201112020002212 |
4 | 123102033311203203023312 |
5 | 111212044440010120042 |
6 | 1103115443441133422 |
7 | 34163541606530603 |
oct | 3322176543431366 |
9 | 521800081466085 |
10 | 120001211020022 |
11 | 35266256217502 |
12 | 1156105692a272 |
13 | 51c60b12ac077 |
14 | 218c137c2b6aa |
15 | dd1790b1b482 |
hex | 6d23f58e32f6 |
120001211020022 has 4 divisors (see below), whose sum is σ = 180001816530036. Its totient is φ = 60000605510010.
The previous prime is 120001211020021. The next prime is 120001211020087. The reversal of 120001211020022 is 220020112100021.
It is a semiprime because it is the product of two primes.
It is a junction number, because it is equal to n+sod(n) for n = 120001211019979 and 120001211020006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120001211020021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30000302755004 + ... + 30000302755007.
It is an arithmetic number, because the mean of its divisors is an integer number (45000454132509).
Almost surely, 2120001211020022 is an apocalyptic number.
120001211020022 is a deficient number, since it is larger than the sum of its proper divisors (60000605510014).
120001211020022 is an equidigital number, since it uses as much as digits as its factorization.
120001211020022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60000605510013.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 120001211020022 its reverse (220020112100021), we get a palindrome (340021323120043).
The spelling of 120001211020022 in words is "one hundred twenty trillion, one billion, two hundred eleven million, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •