Base | Representation |
---|---|
bin | 10100100011001111… |
… | …00011110010001001 |
3 | 1001110220112112020021 |
4 | 22101213203302021 |
5 | 140043422013342 |
6 | 5022443300441 |
7 | 540256650646 |
oct | 122147436211 |
9 | 31426475207 |
10 | 11033001097 |
11 | 4751929028 |
12 | 217ab1a721 |
13 | 106aa10621 |
14 | 769420dcd |
15 | 44890c567 |
hex | 2919e3c89 |
11033001097 has 2 divisors, whose sum is σ = 11033001098. Its totient is φ = 11033001096.
The previous prime is 11033001079. The next prime is 11033001101. The reversal of 11033001097 is 79010033011.
Together with previous prime (11033001079) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5750037241 + 5282963856 = 75829^2 + 72684^2 .
It is a cyclic number.
It is not a de Polignac number, because 11033001097 - 211 = 11032999049 is a prime.
It is a super-2 number, since 2×110330010972 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11033001047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5516500548 + 5516500549.
It is an arithmetic number, because the mean of its divisors is an integer number (5516500549).
Almost surely, 211033001097 is an apocalyptic number.
It is an amenable number.
11033001097 is a deficient number, since it is larger than the sum of its proper divisors (1).
11033001097 is an equidigital number, since it uses as much as digits as its factorization.
11033001097 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 567, while the sum is 25.
The spelling of 11033001097 in words is "eleven billion, thirty-three million, one thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •