Base | Representation |
---|---|
bin | 1010111100001111101001… |
… | …1100111111000100000001 |
3 | 1120121001211001222102000222 |
4 | 2233003322130333010001 |
5 | 3034100131221044022 |
6 | 41330320102552425 |
7 | 2351101230422333 |
oct | 257037234770401 |
9 | 46531731872028 |
10 | 12030110331137 |
11 | 3918a39726298 |
12 | 1423623738715 |
13 | 6935858a4982 |
14 | 2d8390947453 |
15 | 15cde6590242 |
hex | af0fa73f101 |
12030110331137 has 2 divisors, whose sum is σ = 12030110331138. Its totient is φ = 12030110331136.
The previous prime is 12030110331091. The next prime is 12030110331157. The reversal of 12030110331137 is 73113301103021.
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., 9734206560961 + 2295903770176 = 3119969^2 + 1515224^2 .
It is a cyclic number.
It is not a de Polignac number, because 12030110331137 - 212 = 12030110327041 is a prime.
It is not a weakly prime, because it can be changed into another prime (12030110331157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6015055165568 + 6015055165569.
It is an arithmetic number, because the mean of its divisors is an integer number (6015055165569).
Almost surely, 212030110331137 is an apocalyptic number.
It is an amenable number.
12030110331137 is a deficient number, since it is larger than the sum of its proper divisors (1).
12030110331137 is an equidigital number, since it uses as much as digits as its factorization.
12030110331137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 26.
Adding to 12030110331137 its reverse (73113301103021), we get a palindrome (85143411434158).
The spelling of 12030110331137 in words is "twelve trillion, thirty billion, one hundred ten million, three hundred thirty-one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •