Base | Representation |
---|---|
bin | 10101010101000001… |
… | …01001011100111101 |
3 | 1002120000100202021021 |
4 | 22222200221130331 |
5 | 141422324312314 |
6 | 5132122304141 |
7 | 553520442634 |
oct | 125240513475 |
9 | 32500322237 |
10 | 11450619709 |
11 | 4946638081 |
12 | 2276958051 |
13 | 11063b0429 |
14 | 7a8a9051b |
15 | 470401324 |
hex | 2aa82973d |
11450619709 has 2 divisors, whose sum is σ = 11450619710. Its totient is φ = 11450619708.
The previous prime is 11450619679. The next prime is 11450619721. The reversal of 11450619709 is 90791605411.
It is a happy number.
11450619709 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7826940900 + 3623678809 = 88470^2 + 60197^2 .
It is a cyclic number.
It is not a de Polignac number, because 11450619709 - 219 = 11450095421 is a prime.
It is a super-2 number, since 2×114506197092 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11450619809) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5725309854 + 5725309855.
It is an arithmetic number, because the mean of its divisors is an integer number (5725309855).
Almost surely, 211450619709 is an apocalyptic number.
It is an amenable number.
11450619709 is a deficient number, since it is larger than the sum of its proper divisors (1).
11450619709 is an equidigital number, since it uses as much as digits as its factorization.
11450619709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 68040, while the sum is 43.
The spelling of 11450619709 in words is "eleven billion, four hundred fifty million, six hundred nineteen thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •