Base | Representation |
---|---|
bin | 111000110100001101… |
… | …1110000000011110101 |
3 | 102122221011120121211012 |
4 | 1301220123300003311 |
5 | 3444334331030433 |
6 | 132015015122005 |
7 | 11546356666424 |
oct | 1615033600365 |
9 | 378834517735 |
10 | 122011189493 |
11 | 478211545a6 |
12 | 1b791373305 |
13 | b675a7b81b |
14 | 5c964b52bb |
15 | 3291828848 |
hex | 1c686f00f5 |
122011189493 has 2 divisors, whose sum is σ = 122011189494. Its totient is φ = 122011189492.
The previous prime is 122011189483. The next prime is 122011189501. The reversal of 122011189493 is 394981110221.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107254285009 + 14756904484 = 327497^2 + 121478^2 .
It is a cyclic number.
It is not a de Polignac number, because 122011189493 - 212 = 122011185397 is a prime.
It is a super-3 number, since 3×1220111894933 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 122011189493.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122011189423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61005594746 + 61005594747.
It is an arithmetic number, because the mean of its divisors is an integer number (61005594747).
Almost surely, 2122011189493 is an apocalyptic number.
It is an amenable number.
122011189493 is a deficient number, since it is larger than the sum of its proper divisors (1).
122011189493 is an equidigital number, since it uses as much as digits as its factorization.
122011189493 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 31104, while the sum is 41.
The spelling of 122011189493 in words is "one hundred twenty-two billion, eleven million, one hundred eighty-nine thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •