Base | Representation |
---|---|
bin | 10101000101110100… |
… | …10000001000011101 |
3 | 1002020010102210100002 |
4 | 22202322100020131 |
5 | 141142204122023 |
6 | 5111325344045 |
7 | 550411611131 |
oct | 124272201035 |
9 | 32203383302 |
10 | 11323114013 |
11 | 489066a172 |
12 | 2240108025 |
13 | 10b5b59083 |
14 | 795b7d3c1 |
15 | 464116b28 |
hex | 2a2e9021d |
11323114013 has 2 divisors, whose sum is σ = 11323114014. Its totient is φ = 11323114012.
The previous prime is 11323113961. The next prime is 11323114031. The reversal of 11323114013 is 31041132311.
Together with next prime (11323114031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8725988569 + 2597125444 = 93413^2 + 50962^2 .
It is a cyclic number.
It is not a de Polignac number, because 11323114013 - 210 = 11323112989 is a prime.
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 (11323114043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5661557006 + 5661557007.
It is an arithmetic number, because the mean of its divisors is an integer number (5661557007).
Almost surely, 211323114013 is an apocalyptic number.
It is an amenable number.
11323114013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11323114013 is an equidigital number, since it uses as much as digits as its factorization.
11323114013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 11323114013 its reverse (31041132311), we get a palindrome (42364246324).
The spelling of 11323114013 in words is "eleven billion, three hundred twenty-three million, one hundred fourteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •