Base | Representation |
---|---|
bin | 10100100111010111… |
… | …11001010111010001 |
3 | 1001120022211000212221 |
4 | 22103223321113101 |
5 | 140131312124442 |
6 | 5030123021041 |
7 | 541160556031 |
oct | 122353712721 |
9 | 31508730787 |
10 | 11067692497 |
11 | 476a473204 |
12 | 218a66a781 |
13 | 1074c68a94 |
14 | 76dc918c1 |
15 | 44b9b1467 |
hex | 293af95d1 |
11067692497 has 2 divisors, whose sum is σ = 11067692498. Its totient is φ = 11067692496.
The previous prime is 11067692431. The next prime is 11067692513. The reversal of 11067692497 is 79429676011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11058835921 + 8856576 = 105161^2 + 2976^2 .
It is a cyclic number.
It is not a de Polignac number, because 11067692497 - 211 = 11067690449 is a prime.
It is not a weakly prime, because it can be changed into another prime (11067692417) 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, 5533846248 + 5533846249.
It is an arithmetic number, because the mean of its divisors is an integer number (5533846249).
Almost surely, 211067692497 is an apocalyptic number.
It is an amenable number.
11067692497 is a deficient number, since it is larger than the sum of its proper divisors (1).
11067692497 is an equidigital number, since it uses as much as digits as its factorization.
11067692497 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1143072, while the sum is 52.
The spelling of 11067692497 in words is "eleven billion, sixty-seven million, six hundred ninety-two thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •