Base | Representation |
---|---|
bin | 1011000110110010010011… |
… | …0101110111011111000001 |
3 | 1121020101021020012001101001 |
4 | 2301230210311313133001 |
5 | 3100032024242420301 |
6 | 41545430312012001 |
7 | 2400142112311315 |
oct | 261544465673701 |
9 | 47211236161331 |
10 | 12211210123201 |
11 | 3988821850531 |
12 | 1452745691001 |
13 | 6a768732634b |
14 | 303050829b45 |
15 | 1629955dcc01 |
hex | b1b24d777c1 |
12211210123201 has 2 divisors, whose sum is σ = 12211210123202. Its totient is φ = 12211210123200.
The previous prime is 12211210123183. The next prime is 12211210123207. The reversal of 12211210123201 is 10232101211221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11973509996176 + 237700127025 = 3460276^2 + 487545^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12211210123201 is a prime.
It is a super-2 number, since 2×122112101232012 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12211210123207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6105605061600 + 6105605061601.
It is an arithmetic number, because the mean of its divisors is an integer number (6105605061601).
Almost surely, 212211210123201 is an apocalyptic number.
It is an amenable number.
12211210123201 is a deficient number, since it is larger than the sum of its proper divisors (1).
12211210123201 is an equidigital number, since it uses as much as digits as its factorization.
12211210123201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 12211210123201 its reverse (10232101211221), we get a palindrome (22443311334422).
The spelling of 12211210123201 in words is "twelve trillion, two hundred eleven billion, two hundred ten million, one hundred twenty-three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •