Base | Representation |
---|---|
bin | 10011101001110010… |
… | …10010110110111001 |
3 | 1000020022202222102111 |
4 | 21310321102312321 |
5 | 133102041023342 |
6 | 4502550532321 |
7 | 522315651562 |
oct | 116471226671 |
9 | 30208688374 |
10 | 10551111097 |
11 | 4524910a2a |
12 | 20656670a1 |
13 | cc1c29607 |
14 | 721421169 |
15 | 41b470217 |
hex | 274e52db9 |
10551111097 has 2 divisors, whose sum is σ = 10551111098. Its totient is φ = 10551111096.
The previous prime is 10551111091. The next prime is 10551111101. The reversal of 10551111097 is 79011115501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10323372816 + 227738281 = 101604^2 + 15091^2 .
It is an emirp because it is prime and its reverse (79011115501) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10551111097 is a prime.
It is a super-2 number, since 2×105511110972 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10551111091) 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, 5275555548 + 5275555549.
It is an arithmetic number, because the mean of its divisors is an integer number (5275555549).
Almost surely, 210551111097 is an apocalyptic number.
It is an amenable number.
10551111097 is a deficient number, since it is larger than the sum of its proper divisors (1).
10551111097 is an equidigital number, since it uses as much as digits as its factorization.
10551111097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1575, while the sum is 31.
Adding to 10551111097 its reverse (79011115501), we get a palindrome (89562226598).
The spelling of 10551111097 in words is "ten billion, five hundred fifty-one million, one hundred eleven thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •