Base | Representation |
---|---|
bin | 11101011011001001110… |
… | …01001010101011111001 |
3 | 10120122121000201111111201 |
4 | 32231210321022223321 |
5 | 113031022031202022 |
6 | 2052241313254201 |
7 | 133020525252643 |
oct | 16554471125371 |
9 | 3518530644451 |
10 | 1011010022137 |
11 | 35a848889545 |
12 | 143b35264361 |
13 | 744512c1b3b |
14 | 36d0c7a5893 |
15 | 1b473135127 |
hex | eb64e4aaf9 |
1011010022137 has 2 divisors, whose sum is σ = 1011010022138. Its totient is φ = 1011010022136.
The previous prime is 1011010022083. The next prime is 1011010022147. The reversal of 1011010022137 is 7312200101101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 570683550096 + 440326472041 = 755436^2 + 663571^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011010022137 - 227 = 1010875804409 is a prime.
It is a super-2 number, since 2×10110100221372 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1011010022147) 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, 505505011068 + 505505011069.
It is an arithmetic number, because the mean of its divisors is an integer number (505505011069).
Almost surely, 21011010022137 is an apocalyptic number.
It is an amenable number.
1011010022137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011010022137 is an equidigital number, since it uses as much as digits as its factorization.
1011010022137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 19.
Adding to 1011010022137 its reverse (7312200101101), we get a palindrome (8323210123238).
The spelling of 1011010022137 in words is "one trillion, eleven billion, ten million, twenty-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •