Base | Representation |
---|---|
bin | 11011110111000011001010… |
… | …111101111011011101011011 |
3 | 121001211202221120011010201101 |
4 | 123313003022331323131123 |
5 | 112030013403424033001 |
6 | 1112333340035132231 |
7 | 34544342244363655 |
oct | 3367031275733533 |
9 | 531752846133641 |
10 | 122530232252251 |
11 | 3605086382802a |
12 | 118ab21aa44077 |
13 | 534a722341365 |
14 | 22386cdd676d5 |
15 | e2745c46aa01 |
hex | 6f70caf7b75b |
122530232252251 has 12 divisors (see below), whose sum is σ = 125194622499040. Its totient is φ = 119921390431920.
The previous prime is 122530232252213. The next prime is 122530232252327. The reversal of 122530232252251 is 152252232035221.
It is not a de Polignac number, because 122530232252251 - 223 = 122530223863643 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 122530232252251.
It is not an unprimeable number, because it can be changed into a prime (122530232052251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 159262885 + ... + 160030393.
Almost surely, 2122530232252251 is an apocalyptic number.
122530232252251 is a deficient number, since it is larger than the sum of its proper divisors (2664390246789).
122530232252251 is an frugal number, since it uses more digits than its factorization.
122530232252251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 839874 (or 839827 counting only the distinct ones).
The product of its (nonzero) digits is 144000, while the sum is 37.
Adding to 122530232252251 its reverse (152252232035221), we get a palindrome (274782464287472).
The spelling of 122530232252251 in words is "one hundred twenty-two trillion, five hundred thirty billion, two hundred thirty-two million, two hundred fifty-two thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •