Base | Representation |
---|---|
bin | 11011010011101101111010… |
… | …001110100000101000111111 |
3 | 120202020122211021212001221001 |
4 | 123103231322032200220333 |
5 | 111220223322101401421 |
6 | 1103234110530151131 |
7 | 34204046000323264 |
oct | 3323557216405077 |
9 | 522218737761831 |
10 | 120102221122111 |
11 | 352a507a846218 |
12 | 11578746a224a7 |
13 | 520278b154b47 |
14 | 2192d9b0a926b |
15 | dd4203880691 |
hex | 6d3b7a3a0a3f |
120102221122111 has 8 divisors (see below), whose sum is σ = 121848088743360. Its totient is φ = 118366714733568.
The previous prime is 120102221122087. The next prime is 120102221122157. The reversal of 120102221122111 is 111221122201021.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 120102221122111 - 29 = 120102221121599 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120102221122211) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2590284826 + ... + 2590331191.
It is an arithmetic number, because the mean of its divisors is an integer number (15231011092920).
Almost surely, 2120102221122111 is an apocalyptic number.
120102221122111 is a deficient number, since it is larger than the sum of its proper divisors (1745867621249).
120102221122111 is an equidigital number, since it uses as much as digits as its factorization.
120102221122111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5180616353.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 120102221122111 its reverse (111221122201021), we get a palindrome (231323343323132).
The spelling of 120102221122111 in words is "one hundred twenty trillion, one hundred two billion, two hundred twenty-one million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •