Base | Representation |
---|---|
bin | 1011000110001100010011… |
… | …1111100100101001001001 |
3 | 1121012101221111211211002212 |
4 | 2301203010333210221021 |
5 | 3044400133100321022 |
6 | 41541022333234505 |
7 | 2366331311600051 |
oct | 261430477445111 |
9 | 47171844754085 |
10 | 12201012120137 |
11 | 3984469297925 |
12 | 145077a332a35 |
13 | 6a67206007c9 |
14 | 302764284561 |
15 | 16259a16c3e2 |
hex | b18c4fe4a49 |
12201012120137 has 2 divisors, whose sum is σ = 12201012120138. Its totient is φ = 12201012120136.
The previous prime is 12201012120097. The next prime is 12201012120149. The reversal of 12201012120137 is 73102121010221.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8475760851856 + 3725251268281 = 2911316^2 + 1930091^2 .
It is an emirp because it is prime and its reverse (73102121010221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12201012120137 - 228 = 12200743684681 is a prime.
It is not a weakly prime, because it can be changed into another prime (12201012120937) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6100506060068 + 6100506060069.
It is an arithmetic number, because the mean of its divisors is an integer number (6100506060069).
Almost surely, 212201012120137 is an apocalyptic number.
It is an amenable number.
12201012120137 is a deficient number, since it is larger than the sum of its proper divisors (1).
12201012120137 is an equidigital number, since it uses as much as digits as its factorization.
12201012120137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 23.
Adding to 12201012120137 its reverse (73102121010221), we get a palindrome (85303133130358).
The spelling of 12201012120137 in words is "twelve trillion, two hundred one billion, twelve million, one hundred twenty thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •