Base | Representation |
---|---|
bin | 10101011111000001… |
… | …10100011111010101 |
3 | 1002202212021220100111 |
4 | 22233200310133111 |
5 | 142110321112442 |
6 | 5144321243021 |
7 | 555560031364 |
oct | 125740643725 |
9 | 32685256314 |
10 | 11534550997 |
11 | 4989a53982 |
12 | 229aa93471 |
13 | 111a8b9008 |
14 | 7b5c9b7db |
15 | 47797eb17 |
hex | 2af8347d5 |
11534550997 has 2 divisors, whose sum is σ = 11534550998. Its totient is φ = 11534550996.
The previous prime is 11534550947. The next prime is 11534551043. The reversal of 11534550997 is 79905543511.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10429719876 + 1104831121 = 102126^2 + 33239^2 .
It is a cyclic number.
It is not a de Polignac number, because 11534550997 - 219 = 11534026709 is a prime.
It is a super-4 number, since 4×115345509974 (a number of 41 digits) contains 4444 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11534550997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11534550947) 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, 5767275498 + 5767275499.
It is an arithmetic number, because the mean of its divisors is an integer number (5767275499).
Almost surely, 211534550997 is an apocalyptic number.
It is an amenable number.
11534550997 is a deficient number, since it is larger than the sum of its proper divisors (1).
11534550997 is an equidigital number, since it uses as much as digits as its factorization.
11534550997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 850500, while the sum is 49.
The spelling of 11534550997 in words is "eleven billion, five hundred thirty-four million, five hundred fifty thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •