Base | Representation |
---|---|
bin | 11100000010011100010010… |
… | …000111100010011000001011 |
3 | 121011121121200122202101211022 |
4 | 130002130102013202120023 |
5 | 112130330222130014123 |
6 | 1114133132150223055 |
7 | 34655035551426425 |
oct | 3402342207423013 |
9 | 534547618671738 |
10 | 123313110001163 |
11 | 36322883914095 |
12 | 119b6aa7054a8b |
13 | 53a64b7b92bc4 |
14 | 226455a2a9815 |
15 | e3c9cc4881c8 |
hex | 7027121e260b |
123313110001163 has 2 divisors, whose sum is σ = 123313110001164. Its totient is φ = 123313110001162.
The previous prime is 123313110001129. The next prime is 123313110001171. The reversal of 123313110001163 is 361100011313321.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 123313110001163 - 28 = 123313110000907 is a prime.
It is a super-2 number, since 2×1233131100011632 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (123313110001183) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61656555000581 + 61656555000582.
It is an arithmetic number, because the mean of its divisors is an integer number (61656555000582).
Almost surely, 2123313110001163 is an apocalyptic number.
123313110001163 is a deficient number, since it is larger than the sum of its proper divisors (1).
123313110001163 is an equidigital number, since it uses as much as digits as its factorization.
123313110001163 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 26.
Adding to 123313110001163 its reverse (361100011313321), we get a palindrome (484413121314484).
The spelling of 123313110001163 in words is "one hundred twenty-three trillion, three hundred thirteen billion, one hundred ten million, one thousand, one hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •