Base | Representation |
---|---|
bin | 11011110100001000101110… |
… | …101010100101110011010101 |
3 | 121001010122012220211021001212 |
4 | 123310020232222211303111 |
5 | 112013223411102111433 |
6 | 1112101351211231205 |
7 | 34524024315514244 |
oct | 3364105652456325 |
9 | 531118186737055 |
10 | 122330041441493 |
11 | 35a8397428a996 |
12 | 1187846b448505 |
13 | 533489a634712 |
14 | 222cb3c7b695b |
15 | e221423a4d48 |
hex | 6f422eaa5cd5 |
122330041441493 has 2 divisors, whose sum is σ = 122330041441494. Its totient is φ = 122330041441492.
The previous prime is 122330041441403. The next prime is 122330041441501. The reversal of 122330041441493 is 394144140033221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 121026247423249 + 1303794018244 = 11001193^2 + 1141838^2 .
It is a cyclic number.
It is not a de Polignac number, because 122330041441493 - 230 = 122328967699669 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 122330041441493.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122330041441403) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61165020720746 + 61165020720747.
It is an arithmetic number, because the mean of its divisors is an integer number (61165020720747).
Almost surely, 2122330041441493 is an apocalyptic number.
It is an amenable number.
122330041441493 is a deficient number, since it is larger than the sum of its proper divisors (1).
122330041441493 is an equidigital number, since it uses as much as digits as its factorization.
122330041441493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 248832, while the sum is 41.
The spelling of 122330041441493 in words is "one hundred twenty-two trillion, three hundred thirty billion, forty-one million, four hundred forty-one thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •