Base | Representation |
---|---|
bin | 1011000110101110001111… |
… | …1000001110011001011101 |
3 | 1121020021110021100100102001 |
4 | 2301223203320032121131 |
5 | 3100022311234103201 |
6 | 41545130215402301 |
7 | 2400103106306551 |
oct | 261534370163135 |
9 | 47207407310361 |
10 | 12210120222301 |
11 | 3988312603891 |
12 | 14524a0683391 |
13 | 6a75425a0381 |
14 | 302d89b99861 |
15 | 16292ea9e301 |
hex | b1ae3e0e65d |
12210120222301 has 2 divisors, whose sum is σ = 12210120222302. Its totient is φ = 12210120222300.
The previous prime is 12210120222257. The next prime is 12210120222319. The reversal of 12210120222301 is 10322202101221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10001716177401 + 2208404044900 = 3162549^2 + 1486070^2 .
It is an emirp because it is prime and its reverse (10322202101221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12210120222301 - 211 = 12210120220253 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12210120222401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6105060111150 + 6105060111151.
It is an arithmetic number, because the mean of its divisors is an integer number (6105060111151).
Almost surely, 212210120222301 is an apocalyptic number.
It is an amenable number.
12210120222301 is a deficient number, since it is larger than the sum of its proper divisors (1).
12210120222301 is an equidigital number, since it uses as much as digits as its factorization.
12210120222301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 12210120222301 its reverse (10322202101221), we get a palindrome (22532322323522).
The spelling of 12210120222301 in words is "twelve trillion, two hundred ten billion, one hundred twenty million, two hundred twenty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •