Base | Representation |
---|---|
bin | 111000110101011100… |
… | …1011000000101100100 |
3 | 102200001001022220222021 |
4 | 1301222321120011210 |
5 | 3444430420310202 |
6 | 132023052512524 |
7 | 11550401134504 |
oct | 1615271300544 |
9 | 380031286867 |
10 | 122052510052 |
11 | 47842507320 |
12 | 1b7a317b744 |
13 | b6814b8465 |
14 | 5c9bb8da04 |
15 | 329528ba37 |
hex | 1c6ae58164 |
122052510052 has 24 divisors (see below), whose sum is σ = 237966986880. Its totient is φ = 54298020960.
The previous prime is 122052510037. The next prime is 122052510059. The reversal of 122052510052 is 250015250221.
It is a super-2 number, since 2×1220525100522 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122052509999 and 122052510026.
It is not an unprimeable number, because it can be changed into a prime (122052510059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29507727 + ... + 29511862.
It is an arithmetic number, because the mean of its divisors is an integer number (9915291120).
Almost surely, 2122052510052 is an apocalyptic number.
It is an amenable number.
122052510052 is a deficient number, since it is larger than the sum of its proper divisors (115914476828).
122052510052 is a wasteful number, since it uses less digits than its factorization.
122052510052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59019651 (or 59019649 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 25.
Adding to 122052510052 its reverse (250015250221), we get a palindrome (372067760273).
The spelling of 122052510052 in words is "one hundred twenty-two billion, fifty-two million, five hundred ten thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •