Base | Representation |
---|---|
bin | 1011000110010100100010… |
… | …1101101011110000111111 |
3 | 1121012121122112011112020121 |
4 | 2301211020231223300333 |
5 | 3044414144314220411 |
6 | 41542025515155411 |
7 | 2366440134503161 |
oct | 261451055536077 |
9 | 47177575145217 |
10 | 12203222023231 |
11 | 39853a2770818 |
12 | 1451096445b67 |
13 | 6a69b33bb885 |
14 | 3028d397c931 |
15 | 162679193571 |
hex | b1948b6bc3f |
12203222023231 has 2 divisors, whose sum is σ = 12203222023232. Its totient is φ = 12203222023230.
The previous prime is 12203222023219. The next prime is 12203222023241. The reversal of 12203222023231 is 13232022230221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12203222023231 - 219 = 12203221498943 is a prime.
It is a super-5 number, since 5×122032220232315 (a number of 67 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 12203222023196 and 12203222023205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12203222023241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6101611011615 + 6101611011616.
It is an arithmetic number, because the mean of its divisors is an integer number (6101611011616).
Almost surely, 212203222023231 is an apocalyptic number.
12203222023231 is a deficient number, since it is larger than the sum of its proper divisors (1).
12203222023231 is an equidigital number, since it uses as much as digits as its factorization.
12203222023231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 12203222023231 its reverse (13232022230221), we get a palindrome (25435244253452).
The spelling of 12203222023231 in words is "twelve trillion, two hundred three billion, two hundred twenty-two million, twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •