Base | Representation |
---|---|
bin | 10100100100110101… |
… | …10001000000111101 |
3 | 1001111211210111212102 |
4 | 22102122301000331 |
5 | 140110341042022 |
6 | 5024043114445 |
7 | 540512026433 |
oct | 122232610075 |
9 | 31454714772 |
10 | 11046424637 |
11 | 4759467366 |
12 | 2183512a25 |
13 | 1070730551 |
14 | 76b116d53 |
15 | 449baea92 |
hex | 2926b103d |
11046424637 has 2 divisors, whose sum is σ = 11046424638. Its totient is φ = 11046424636.
The previous prime is 11046424633. The next prime is 11046424639. The reversal of 11046424637 is 73642464011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10702730116 + 343694521 = 103454^2 + 18539^2 .
It is a cyclic number.
It is not a de Polignac number, because 11046424637 - 22 = 11046424633 is a prime.
Together with 11046424639, 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 11046424637.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11046424633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5523212318 + 5523212319.
It is an arithmetic number, because the mean of its divisors is an integer number (5523212319).
Almost surely, 211046424637 is an apocalyptic number.
It is an amenable number.
11046424637 is a deficient number, since it is larger than the sum of its proper divisors (1).
11046424637 is an equidigital number, since it uses as much as digits as its factorization.
11046424637 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96768, while the sum is 38.
Adding to 11046424637 its reverse (73642464011), we get a palindrome (84688888648).
The spelling of 11046424637 in words is "eleven billion, forty-six million, four hundred twenty-four thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •