Base | Representation |
---|---|
bin | 111000111110011011… |
… | …1101000000011000111 |
3 | 102200211001201021201022 |
4 | 1301330313220003013 |
5 | 4001040113303111 |
6 | 132113023421355 |
7 | 11561022121535 |
oct | 1617467500307 |
9 | 380731637638 |
10 | 122354041031 |
11 | 47987736a82 |
12 | 1b86815485b |
13 | b6cbb01061 |
14 | 5cc9c41155 |
15 | 32b199e2db |
hex | 1c7cde80c7 |
122354041031 has 2 divisors, whose sum is σ = 122354041032. Its totient is φ = 122354041030.
The previous prime is 122354041013. The next prime is 122354041141. The reversal of 122354041031 is 130140453221.
It is a happy number.
Together with previous prime (122354041013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is an emirp because it is prime and its reverse (130140453221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 122354041031 - 26 = 122354040967 is a prime.
It is a super-2 number, since 2×1223540410312 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122354044031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61177020515 + 61177020516.
It is an arithmetic number, because the mean of its divisors is an integer number (61177020516).
Almost surely, 2122354041031 is an apocalyptic number.
122354041031 is a deficient number, since it is larger than the sum of its proper divisors (1).
122354041031 is an equidigital number, since it uses as much as digits as its factorization.
122354041031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 122354041031 its reverse (130140453221), we get a palindrome (252494494252).
The spelling of 122354041031 in words is "one hundred twenty-two billion, three hundred fifty-four million, forty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •