Base | Representation |
---|---|
bin | 11011110011111001010000… |
… | …101110011011010001111010 |
3 | 121001002001100110010011202002 |
4 | 123303321100232123101322 |
5 | 112012440402322100010 |
6 | 1112050003154541002 |
7 | 34522565615231165 |
oct | 3363712056332172 |
9 | 531061313104662 |
10 | 122313433003130 |
11 | 35a77921253376 |
12 | 118751b5297762 |
13 | 53331517b9ab5 |
14 | 222c004b02adc |
15 | e219be2761a5 |
hex | 6f3e50b9b47a |
122313433003130 has 16 divisors (see below), whose sum is σ = 220164306913800. Its totient is φ = 48925344866112.
The previous prime is 122313433003081. The next prime is 122313433003163. The reversal of 122313433003130 is 31300334313221.
It can be written as a sum of positive squares in 4 ways, for example, as 89557510491289 + 32755922511841 = 9463483^2 + 5723279^2 .
It is a super-2 number, since 2×1223134330031302 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 122313433003093 and 122313433003102.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27767396 + ... + 31869344.
Almost surely, 2122313433003130 is an apocalyptic number.
122313433003130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
122313433003130 is a deficient number, since it is larger than the sum of its proper divisors (97850873910670).
122313433003130 is a wasteful number, since it uses less digits than its factorization.
122313433003130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7083793.
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 122313433003130 its reverse (31300334313221), we get a palindrome (153613767316351).
The spelling of 122313433003130 in words is "one hundred twenty-two trillion, three hundred thirteen billion, four hundred thirty-three million, three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •