Base | Representation |
---|---|
bin | 10101010000101001… |
… | …11110000110000101 |
3 | 1002110110110111002122 |
4 | 22220110332012011 |
5 | 141333441112401 |
6 | 5124333415325 |
7 | 552564301613 |
oct | 125024760605 |
9 | 32413414078 |
10 | 11414004101 |
11 | 49279a9245 |
12 | 226663a545 |
13 | 10cb9301a6 |
14 | 7a3c7c6b3 |
15 | 46c0bc21b |
hex | 2a853e185 |
11414004101 has 2 divisors, whose sum is σ = 11414004102. Its totient is φ = 11414004100.
The previous prime is 11414004073. The next prime is 11414004103. The reversal of 11414004101 is 10140041411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9020250625 + 2393753476 = 94975^2 + 48926^2 .
It is an emirp because it is prime and its reverse (10140041411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11414004101 - 218 = 11413741957 is a prime.
Together with 11414004103, 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 11414004101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11414004103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5707002050 + 5707002051.
It is an arithmetic number, because the mean of its divisors is an integer number (5707002051).
Almost surely, 211414004101 is an apocalyptic number.
It is an amenable number.
11414004101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11414004101 is an equidigital number, since it uses as much as digits as its factorization.
11414004101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 11414004101 its reverse (10140041411), we get a palindrome (21554045512).
The spelling of 11414004101 in words is "eleven billion, four hundred fourteen million, four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •