Base | Representation |
---|---|
bin | 10010000110111100101… |
… | …111011110010100011011 |
3 | 11101222001012221001201101 |
4 | 102012330233132110123 |
5 | 130342024000010412 |
6 | 2351401450132231 |
7 | 155622456260425 |
oct | 22067457362433 |
9 | 4358035831641 |
10 | 1244412110107 |
11 | 43a830215821 |
12 | 181213121077 |
13 | 904697803ba |
14 | 44330a83815 |
15 | 22583bee457 |
hex | 121bcbde51b |
1244412110107 has 2 divisors, whose sum is σ = 1244412110108. Its totient is φ = 1244412110106.
The previous prime is 1244412110101. The next prime is 1244412110113. The reversal of 1244412110107 is 7010112144421.
It is a balanced prime because it is at equal distance from previous prime (1244412110101) and next prime (1244412110113).
It is a cyclic number.
It is not a de Polignac number, because 1244412110107 - 23 = 1244412110099 is a prime.
It is a super-2 number, since 2×12444121101072 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1244412110101) 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, 622206055053 + 622206055054.
It is an arithmetic number, because the mean of its divisors is an integer number (622206055054).
Almost surely, 21244412110107 is an apocalyptic number.
1244412110107 is a deficient number, since it is larger than the sum of its proper divisors (1).
1244412110107 is an equidigital number, since it uses as much as digits as its factorization.
1244412110107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1792, while the sum is 28.
Adding to 1244412110107 its reverse (7010112144421), we get a palindrome (8254524254528).
The spelling of 1244412110107 in words is "one trillion, two hundred forty-four billion, four hundred twelve million, one hundred ten thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •