Base | Representation |
---|---|
bin | 111001000100010111… |
… | …0110001100101110101 |
3 | 102201022221011212011001 |
4 | 1302020232301211311 |
5 | 4001442040004123 |
6 | 132144453043301 |
7 | 11565656500216 |
oct | 1621056614565 |
9 | 381287155131 |
10 | 122553047413 |
11 | 47a7a000465 |
12 | 1b902926531 |
13 | b7310cb004 |
14 | 5d0844540d |
15 | 32c41ae0ad |
hex | 1c88bb1975 |
122553047413 has 4 divisors (see below), whose sum is σ = 129762050220. Its totient is φ = 115344044608.
The previous prime is 122553047327. The next prime is 122553047431. The reversal of 122553047413 is 314740355221.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 33066512964 + 89486534449 = 181842^2 + 299143^2 .
It is a cyclic number.
It is not a de Polignac number, because 122553047413 - 229 = 122016176501 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122553047443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3604501378 + ... + 3604501411.
It is an arithmetic number, because the mean of its divisors is an integer number (32440512555).
Almost surely, 2122553047413 is an apocalyptic number.
It is an amenable number.
122553047413 is a deficient number, since it is larger than the sum of its proper divisors (7209002807).
122553047413 is an equidigital number, since it uses as much as digits as its factorization.
122553047413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7209002806.
The product of its (nonzero) digits is 100800, while the sum is 37.
The spelling of 122553047413 in words is "one hundred twenty-two billion, five hundred fifty-three million, forty-seven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •