Base | Representation |
---|---|
bin | 111000110100001100… |
… | …0011100000110101101 |
3 | 102122221002221111220211 |
4 | 1301220120130012231 |
5 | 3444334120240300 |
6 | 132014544342421 |
7 | 11546346422344 |
oct | 1615030340655 |
9 | 378832844824 |
10 | 122010321325 |
11 | 47820711302 |
12 | 1b791014a11 |
13 | b675836609 |
14 | 5c9632ab5b |
15 | 32917064ba |
hex | 1c6861c1ad |
122010321325 has 12 divisors (see below), whose sum is σ = 160192375380. Its totient is φ = 91866594560.
The previous prime is 122010321269. The next prime is 122010321331. The reversal of 122010321325 is 523123010221.
It can be written as a sum of positive squares in 6 ways, for example, as 339812356 + 121670508969 = 18434^2 + 348813^2 .
It is a de Polignac number, because none of the positive numbers 2k-122010321325 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122010321296 and 122010321305.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 143541130 + ... + 143541979.
It is an arithmetic number, because the mean of its divisors is an integer number (13349364615).
Almost surely, 2122010321325 is an apocalyptic number.
It is an amenable number.
122010321325 is a deficient number, since it is larger than the sum of its proper divisors (38182054055).
122010321325 is a wasteful number, since it uses less digits than its factorization.
122010321325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287083136 (or 287083131 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 22.
Adding to 122010321325 its reverse (523123010221), we get a palindrome (645133331546).
The spelling of 122010321325 in words is "one hundred twenty-two billion, ten million, three hundred twenty-one thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.413 sec. • engine limits •