Base | Representation |
---|---|
bin | 1011000000011100100101… |
… | …0011100100001010010101 |
3 | 1120211222011002222211120022 |
4 | 2300013021103210022111 |
5 | 3041241002324101401 |
6 | 41423415302514525 |
7 | 2356235165365625 |
oct | 260071123441225 |
9 | 46758132884508 |
10 | 12102300222101 |
11 | 3946613a72901 |
12 | 143560ba35a45 |
13 | 69a31b92159b |
14 | 2dba7c328885 |
15 | 15ec1e07271b |
hex | b01c94e4295 |
12102300222101 has 2 divisors, whose sum is σ = 12102300222102. Its totient is φ = 12102300222100.
The previous prime is 12102300222083. The next prime is 12102300222113. The reversal of 12102300222101 is 10122200320121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6612997980625 + 5489302241476 = 2571575^2 + 2342926^2 .
It is a cyclic number.
It is not a de Polignac number, because 12102300222101 - 218 = 12102299959957 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12102300222101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12102300242101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6051150111050 + 6051150111051.
It is an arithmetic number, because the mean of its divisors is an integer number (6051150111051).
Almost surely, 212102300222101 is an apocalyptic number.
It is an amenable number.
12102300222101 is a deficient number, since it is larger than the sum of its proper divisors (1).
12102300222101 is an equidigital number, since it uses as much as digits as its factorization.
12102300222101 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 17.
Adding to 12102300222101 its reverse (10122200320121), we get a palindrome (22224500542222).
The spelling of 12102300222101 in words is "twelve trillion, one hundred two billion, three hundred million, two hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •