Base | Representation |
---|---|
bin | 11011010101001011000011… |
… | …001110100111010101011111 |
3 | 120202121012222002110021022112 |
4 | 123111023003032213111133 |
5 | 111223343131403242421 |
6 | 1103352050414304235 |
7 | 34214216214024656 |
oct | 3325130316472537 |
9 | 522535862407275 |
10 | 120202230134111 |
11 | 35333530277154 |
12 | 11593bb77b807b |
13 | 520c03879b518 |
14 | 2197b673d419d |
15 | dd6b0879a45b |
hex | 6d52c33a755f |
120202230134111 has 16 divisors (see below), whose sum is σ = 121303961856000. Its totient is φ = 119104461076128.
The previous prime is 120202230134093. The next prime is 120202230134141. The reversal of 120202230134111 is 111431032202021.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120202230134111 is a prime.
It is a super-2 number, since 2×1202022301341112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120202230134141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1681043786 + ... + 1681115288.
It is an arithmetic number, because the mean of its divisors is an integer number (7581497616000).
Almost surely, 2120202230134111 is an apocalyptic number.
120202230134111 is a deficient number, since it is larger than the sum of its proper divisors (1101731721889).
120202230134111 is a wasteful number, since it uses less digits than its factorization.
120202230134111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98998.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 120202230134111 its reverse (111431032202021), we get a palindrome (231633262336132).
The spelling of 120202230134111 in words is "one hundred twenty trillion, two hundred two billion, two hundred thirty million, one hundred thirty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.319 sec. • engine limits •