Base | Representation |
---|---|
bin | 10010000110110000110… |
… | …101010000110110010001 |
3 | 11101221112021221201102112 |
4 | 102012300311100312101 |
5 | 130341121322114301 |
6 | 2351325551355105 |
7 | 155614512030242 |
oct | 22066065206621 |
9 | 4357467851375 |
10 | 1244212301201 |
11 | 43a7384533a1 |
12 | 181178222a95 |
13 | 9043726208c |
14 | 44312310cc9 |
15 | 225713d19bb |
hex | 121b0d50d91 |
1244212301201 has 2 divisors, whose sum is σ = 1244212301202. Its totient is φ = 1244212301200.
The previous prime is 1244212301179. The next prime is 1244212301239. The reversal of 1244212301201 is 1021032124421.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1149441294400 + 94771006801 = 1072120^2 + 307849^2 .
It is a cyclic number.
It is not a de Polignac number, because 1244212301201 - 214 = 1244212284817 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1244212301281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 622106150600 + 622106150601.
It is an arithmetic number, because the mean of its divisors is an integer number (622106150601).
Almost surely, 21244212301201 is an apocalyptic number.
It is an amenable number.
1244212301201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1244212301201 is an equidigital number, since it uses as much as digits as its factorization.
1244212301201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 1244212301201 its reverse (1021032124421), we get a palindrome (2265244425622).
The spelling of 1244212301201 in words is "one trillion, two hundred forty-four billion, two hundred twelve million, three hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •