Base | Representation |
---|---|
bin | 111001011011000001… |
… | …0001011110011010101 |
3 | 102210021220101001022201 |
4 | 1302312002023303111 |
5 | 4010021124011404 |
6 | 132352123524501 |
7 | 11623546066621 |
oct | 1626602136325 |
9 | 383256331281 |
10 | 123313110229 |
11 | 4832a043951 |
12 | 1ba95389731 |
13 | b822709b1a |
14 | 5d7b376181 |
15 | 331ac97ca4 |
hex | 1cb608bcd5 |
123313110229 has 2 divisors, whose sum is σ = 123313110230. Its totient is φ = 123313110228.
The previous prime is 123313110163. The next prime is 123313110247. The reversal of 123313110229 is 922011313321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90707585329 + 32605524900 = 301177^2 + 180570^2 .
It is a cyclic number.
It is not a de Polignac number, because 123313110229 - 217 = 123312979157 is a prime.
It is a super-2 number, since 2×1233131102292 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 123313110197 and 123313110206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123313110269) 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, 61656555114 + 61656555115.
It is an arithmetic number, because the mean of its divisors is an integer number (61656555115).
Almost surely, 2123313110229 is an apocalyptic number.
It is an amenable number.
123313110229 is a deficient number, since it is larger than the sum of its proper divisors (1).
123313110229 is an equidigital number, since it uses as much as digits as its factorization.
123313110229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 28.
The spelling of 123313110229 in words is "one hundred twenty-three billion, three hundred thirteen million, one hundred ten thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •