Base | Representation |
---|---|
bin | 10101000010011111… |
… | …10111001110011001 |
3 | 1002011011221212102122 |
4 | 22201033313032121 |
5 | 141113034142404 |
6 | 5104451511025 |
7 | 546622553225 |
oct | 124117671631 |
9 | 32134855378 |
10 | 11295224729 |
11 | 4876950578 |
12 | 22328b8475 |
13 | 10b0142a39 |
14 | 79219d785 |
15 | 4619583be |
hex | 2a13f7399 |
11295224729 has 2 divisors, whose sum is σ = 11295224730. Its totient is φ = 11295224728.
The previous prime is 11295224719. The next prime is 11295224737. The reversal of 11295224729 is 92742259211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7805369104 + 3489855625 = 88348^2 + 59075^2 .
It is a cyclic number.
It is not a de Polignac number, because 11295224729 - 212 = 11295220633 is a prime.
It is a super-2 number, since 2×112952247292 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11295224729.
It is not a weakly prime, because it can be changed into another prime (11295224719) 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, 5647612364 + 5647612365.
It is an arithmetic number, because the mean of its divisors is an integer number (5647612365).
Almost surely, 211295224729 is an apocalyptic number.
It is an amenable number.
11295224729 is a deficient number, since it is larger than the sum of its proper divisors (1).
11295224729 is an equidigital number, since it uses as much as digits as its factorization.
11295224729 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 181440, while the sum is 44.
The spelling of 11295224729 in words is "eleven billion, two hundred ninety-five million, two hundred twenty-four thousand, seven hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •