Base | Representation |
---|---|
bin | 11011111001101010111111… |
… | …010110100100100111100011 |
3 | 121002111000001120111120112220 |
4 | 123321222333112210213203 |
5 | 112040441423024342011 |
6 | 1112552220320522123 |
7 | 34563351515151456 |
oct | 3371527726444743 |
9 | 532430046446486 |
10 | 122710426012131 |
11 | 3611022147a941 |
12 | 1191a129480343 |
13 | 536170b166809 |
14 | 224330579d49d |
15 | e2bea6b99506 |
hex | 6f9abf5a49e3 |
122710426012131 has 16 divisors (see below), whose sum is σ = 168893270827008. Its totient is φ = 79167312864000.
The previous prime is 122710426012073. The next prime is 122710426012177. The reversal of 122710426012131 is 131210624017221.
It is not a de Polignac number, because 122710426012131 - 211 = 122710426010083 is a prime.
It is a super-2 number, since 2×1227104260121312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122710426012092 and 122710426012101.
It is not an unprimeable number, because it can be changed into a prime (122710426012231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4752531 + ... + 16370931.
It is an arithmetic number, because the mean of its divisors is an integer number (10555829426688).
Almost surely, 2122710426012131 is an apocalyptic number.
122710426012131 is a deficient number, since it is larger than the sum of its proper divisors (46182844814877).
122710426012131 is a wasteful number, since it uses less digits than its factorization.
122710426012131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11732002.
The product of its (nonzero) digits is 8064, while the sum is 33.
The spelling of 122710426012131 in words is "one hundred twenty-two trillion, seven hundred ten billion, four hundred twenty-six million, twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •