Base | Representation |
---|---|
bin | 1011000111010011011011… |
… | …0101101100001000110001 |
3 | 1121021020012220211020212212 |
4 | 2301310312311230020301 |
5 | 3100203232103014301 |
6 | 41553500511501505 |
7 | 2400605343112013 |
oct | 261646665541061 |
9 | 47236186736785 |
10 | 12220102001201 |
11 | 3991575003036 |
12 | 1454407527895 |
13 | 6a847357b013 |
14 | 3036557381b3 |
15 | 162d1605d4bb |
hex | b1d36d6c231 |
12220102001201 has 2 divisors, whose sum is σ = 12220102001202. Its totient is φ = 12220102001200.
The previous prime is 12220102001167. The next prime is 12220102001207. The reversal of 12220102001201 is 10210020102221.
12220102001201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6850384920976 + 5369717080225 = 2617324^2 + 2317265^2 .
It is a cyclic number.
It is not a de Polignac number, because 12220102001201 - 218 = 12220101739057 is a prime.
It is not a weakly prime, because it can be changed into another prime (12220102001207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110051000600 + 6110051000601.
It is an arithmetic number, because the mean of its divisors is an integer number (6110051000601).
Almost surely, 212220102001201 is an apocalyptic number.
It is an amenable number.
12220102001201 is a deficient number, since it is larger than the sum of its proper divisors (1).
12220102001201 is an equidigital number, since it uses as much as digits as its factorization.
12220102001201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 12220102001201 its reverse (10210020102221), we get a palindrome (22430122103422).
The spelling of 12220102001201 in words is "twelve trillion, two hundred twenty billion, one hundred two million, one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •