Base | Representation |
---|---|
bin | 11101011011100100100… |
… | …01001001001000111111 |
3 | 10120200011122221122020222 |
4 | 32231302101021020333 |
5 | 113032002002123241 |
6 | 2052315450531555 |
7 | 133026221446043 |
oct | 16556221111077 |
9 | 3520148848228 |
10 | 1011234411071 |
11 | 35a95350a245 |
12 | 143b98436bbb |
13 | 74488938161 |
14 | 36d304d6023 |
15 | 1b487baaa4b |
hex | eb7244923f |
1011234411071 has 2 divisors, whose sum is σ = 1011234411072. Its totient is φ = 1011234411070.
The previous prime is 1011234410971. The next prime is 1011234411073. The reversal of 1011234411071 is 1701144321101.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1011234411071 is a prime.
It is a super-2 number, since 2×10112344110712 (a number of 25 digits) contains 22 as substring.
Together with 1011234411073, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1011234411071.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1011234411073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505617205535 + 505617205536.
It is an arithmetic number, because the mean of its divisors is an integer number (505617205536).
Almost surely, 21011234411071 is an apocalyptic number.
1011234411071 is a deficient number, since it is larger than the sum of its proper divisors (1).
1011234411071 is an equidigital number, since it uses as much as digits as its factorization.
1011234411071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 26.
Adding to 1011234411071 its reverse (1701144321101), we get a palindrome (2712378732172).
The spelling of 1011234411071 in words is "one trillion, eleven billion, two hundred thirty-four million, four hundred eleven thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •