Base | Representation |
---|---|
bin | 10100100001000000… |
… | …10001100001000101 |
3 | 1001102121101010102112 |
4 | 22100200101201011 |
5 | 140024131022203 |
6 | 5020534550405 |
7 | 536642060531 |
oct | 122040214105 |
9 | 31377333375 |
10 | 11014314053 |
11 | 4742325196 |
12 | 2174808405 |
13 | 1066b999c2 |
14 | 766b58bc1 |
15 | 446e6a6d8 |
hex | 290811845 |
11014314053 has 2 divisors, whose sum is σ = 11014314054. Its totient is φ = 11014314052.
The previous prime is 11014314019. The next prime is 11014314133. The reversal of 11014314053 is 35041341011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10076545924 + 937768129 = 100382^2 + 30623^2 .
It is a cyclic number.
It is not a de Polignac number, because 11014314053 - 210 = 11014313029 is a prime.
It is a super-2 number, since 2×110143140532 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11014310053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5507157026 + 5507157027.
It is an arithmetic number, because the mean of its divisors is an integer number (5507157027).
Almost surely, 211014314053 is an apocalyptic number.
It is an amenable number.
11014314053 is a deficient number, since it is larger than the sum of its proper divisors (1).
11014314053 is an equidigital number, since it uses as much as digits as its factorization.
11014314053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 720, while the sum is 23.
Adding to 11014314053 its reverse (35041341011), we get a palindrome (46055655064).
The spelling of 11014314053 in words is "eleven billion, fourteen million, three hundred fourteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •