Base | Representation |
---|---|
bin | 1010010001010011100001… |
… | …0001101010101001011001 |
3 | 1110222112200200122010122012 |
4 | 2210110320101222221121 |
5 | 2440003330233121114 |
6 | 40003355112435305 |
7 | 2243564345156531 |
oct | 244247021525131 |
9 | 43875620563565 |
10 | 11292413176409 |
11 | 36640a3933372 |
12 | 13246663a8b35 |
13 | 63bb404b5721 |
14 | 2b07acc444c1 |
15 | 148b1cc8563e |
hex | a453846aa59 |
11292413176409 has 2 divisors, whose sum is σ = 11292413176410. Its totient is φ = 11292413176408.
The previous prime is 11292413176393. The next prime is 11292413176411. The reversal of 11292413176409 is 90467131429211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6931846465600 + 4360566710809 = 2632840^2 + 2088197^2 .
It is a cyclic number.
It is not a de Polignac number, because 11292413176409 - 24 = 11292413176393 is a prime.
Together with 11292413176411, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (11292413175409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5646206588204 + 5646206588205.
It is an arithmetic number, because the mean of its divisors is an integer number (5646206588205).
Almost surely, 211292413176409 is an apocalyptic number.
It is an amenable number.
11292413176409 is a deficient number, since it is larger than the sum of its proper divisors (1).
11292413176409 is an equidigital number, since it uses as much as digits as its factorization.
11292413176409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 653184, while the sum is 50.
The spelling of 11292413176409 in words is "eleven trillion, two hundred ninety-two billion, four hundred thirteen million, one hundred seventy-six thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •