Base | Representation |
---|---|
bin | 11011010011101101101110… |
… | …010111110011100010010011 |
3 | 120202020122022102121102021110 |
4 | 123103231232113303202103 |
5 | 111220222420142412321 |
6 | 1103234035103224403 |
7 | 34204041033641325 |
oct | 3323555627634223 |
9 | 522218272542243 |
10 | 120102022232211 |
11 | 352a4a885512a8 |
12 | 115786b02a8103 |
13 | 5202758b98c06 |
14 | 2192d7c8d5615 |
15 | dd41e1195176 |
hex | 6d3b6e5f3893 |
120102022232211 has 8 divisors (see below), whose sum is σ = 160152506277120. Its totient is φ = 80059776504392.
The previous prime is 120102022232177. The next prime is 120102022232219. The reversal of 120102022232211 is 112232220201021.
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 120102022232211 - 29 = 120102022231699 is a prime.
It is a super-3 number, since 3×1201020222322113 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (120102022232219) 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, 2059545255 + ... + 2059603568.
It is an arithmetic number, because the mean of its divisors is an integer number (20019063284640).
Almost surely, 2120102022232211 is an apocalyptic number.
120102022232211 is a deficient number, since it is larger than the sum of its proper divisors (40050484044909).
120102022232211 is an equidigital number, since it uses as much as digits as its factorization.
120102022232211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4119158545.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 120102022232211 its reverse (112232220201021), we get a palindrome (232334242433232).
The spelling of 120102022232211 in words is "one hundred twenty trillion, one hundred two billion, twenty-two million, two hundred thirty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •