Base | Representation |
---|---|
bin | 11011110010001111101101… |
… | …101011110001001000010001 |
3 | 121000200012211020020111001202 |
4 | 123302033231223301020101 |
5 | 112004111302131241423 |
6 | 1111521541342440545 |
7 | 34511444310343562 |
oct | 3362175553611021 |
9 | 530605736214052 |
10 | 122200102212113 |
11 | 35a33854a48712 |
12 | 11857246b93155 |
13 | 5325560219843 |
14 | 222673340a169 |
15 | e1da89a47728 |
hex | 6f23edaf1211 |
122200102212113 has 16 divisors (see below), whose sum is σ = 125468589979920. Its totient is φ = 118974639801600.
The previous prime is 122200102212109. The next prime is 122200102212119. The reversal of 122200102212113 is 311212201002221.
It can be written as a sum of positive squares in 8 ways, for example, as 2181788959744 + 120018313252369 = 1477088^2 + 10955287^2 .
It is a cyclic number.
It is not a de Polignac number, because 122200102212113 - 22 = 122200102212109 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122200102212119) 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, 2587958 + ... + 15846063.
It is an arithmetic number, because the mean of its divisors is an integer number (7841786873745).
Almost surely, 2122200102212113 is an apocalyptic number.
It is an amenable number.
122200102212113 is a deficient number, since it is larger than the sum of its proper divisors (3268487767807).
122200102212113 is a wasteful number, since it uses less digits than its factorization.
122200102212113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18435188.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 122200102212113 its reverse (311212201002221), we get a palindrome (433412303214334).
The spelling of 122200102212113 in words is "one hundred twenty-two trillion, two hundred billion, one hundred two million, two hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •