Base | Representation |
---|---|
bin | 11011110001001000000001… |
… | …110101111011111111010111 |
3 | 121000101212010222100100002111 |
4 | 123301020001311323333113 |
5 | 112001331133014323111 |
6 | 1111422331502451451 |
7 | 34503051014051533 |
oct | 3361100165737727 |
9 | 530355128310074 |
10 | 122123131011031 |
11 | 35a04146792037 |
12 | 11844345593b87 |
13 | 531b214740647 |
14 | 2222b10a12bc3 |
15 | e1ba8240aa21 |
hex | 6f1201d7bfd7 |
122123131011031 has 2 divisors, whose sum is σ = 122123131011032. Its totient is φ = 122123131011030.
The previous prime is 122123131010989. The next prime is 122123131011047. The reversal of 122123131011031 is 130110131321221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 122123131011031 - 213 = 122123131002839 is a prime.
It is a super-2 number, since 2×1221231310110312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 122123131010993 and 122123131011011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122123131015031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61061565505515 + 61061565505516.
It is an arithmetic number, because the mean of its divisors is an integer number (61061565505516).
Almost surely, 2122123131011031 is an apocalyptic number.
122123131011031 is a deficient number, since it is larger than the sum of its proper divisors (1).
122123131011031 is an equidigital number, since it uses as much as digits as its factorization.
122123131011031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 122123131011031 its reverse (130110131321221), we get a palindrome (252233262332252).
The spelling of 122123131011031 in words is "one hundred twenty-two trillion, one hundred twenty-three billion, one hundred thirty-one million, eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •