Base | Representation |
---|---|
bin | 10000000001110010111… |
… | …101101100001011011001 |
3 | 10220022000021102210000001 |
4 | 100001302331230023121 |
5 | 121021222220332022 |
6 | 2201554510213001 |
7 | 142401501641455 |
oct | 20016275541331 |
9 | 3808007383001 |
10 | 1101440402137 |
11 | 395133435489 |
12 | 1595721b4161 |
13 | 7cb3333162a |
14 | 3b44a8d5665 |
15 | 1d9b7176b27 |
hex | 10072f6c2d9 |
1101440402137 has 2 divisors, whose sum is σ = 1101440402138. Its totient is φ = 1101440402136.
The previous prime is 1101440402119. The next prime is 1101440402213. The reversal of 1101440402137 is 7312040441011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 943717045401 + 157723356736 = 971451^2 + 397144^2 .
It is an emirp because it is prime and its reverse (7312040441011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1101440402137 - 219 = 1101439877849 is a prime.
It is not a weakly prime, because it can be changed into another prime (1101440402437) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550720201068 + 550720201069.
It is an arithmetic number, because the mean of its divisors is an integer number (550720201069).
Almost surely, 21101440402137 is an apocalyptic number.
It is an amenable number.
1101440402137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101440402137 is an equidigital number, since it uses as much as digits as its factorization.
1101440402137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2688, while the sum is 28.
Adding to 1101440402137 its reverse (7312040441011), we get a palindrome (8413480843148).
The spelling of 1101440402137 in words is "one trillion, one hundred one billion, four hundred forty million, four hundred two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •