Base | Representation |
---|---|
bin | 1011000111111000110010… |
… | …1011100001011011111101 |
3 | 1121022012002221020122000201 |
4 | 2301332030223201123331 |
5 | 3100334302310023401 |
6 | 42002240051523501 |
7 | 2401412034460642 |
oct | 261761453413375 |
9 | 47265087218021 |
10 | 12230132111101 |
11 | 3995851813063 |
12 | 14563465b9591 |
13 | 6a93b157b4a8 |
14 | 303d27897dc9 |
15 | 1632018b7b01 |
hex | b1f8cae16fd |
12230132111101 has 2 divisors, whose sum is σ = 12230132111102. Its totient is φ = 12230132111100.
The previous prime is 12230132111081. The next prime is 12230132111179. The reversal of 12230132111101 is 10111123103221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8717315300100 + 3512816811001 = 2952510^2 + 1874251^2 .
It is a cyclic number.
It is not a de Polignac number, because 12230132111101 - 223 = 12230123722493 is a prime.
It is a super-2 number, since 2×122301321111012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12230135111101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6115066055550 + 6115066055551.
It is an arithmetic number, because the mean of its divisors is an integer number (6115066055551).
Almost surely, 212230132111101 is an apocalyptic number.
It is an amenable number.
12230132111101 is a deficient number, since it is larger than the sum of its proper divisors (1).
12230132111101 is an equidigital number, since it uses as much as digits as its factorization.
12230132111101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 12230132111101 its reverse (10111123103221), we get a palindrome (22341255214322).
The spelling of 12230132111101 in words is "twelve trillion, two hundred thirty billion, one hundred thirty-two million, one hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •