Base | Representation |
---|---|
bin | 10000000010100000010… |
… | …11101101001111111011 |
3 | 1221200111011212112100202 |
4 | 20001100023231033323 |
5 | 33012123332410331 |
6 | 1101101120152415 |
7 | 54546540502001 |
oct | 10012013551773 |
9 | 1850434775322 |
10 | 551101060091 |
11 | 1a27a21aa26a |
12 | 8a98276870b |
13 | 3cc7904cb3a |
14 | 1c95dc8aa71 |
15 | e506ebcecb |
hex | 80502ed3fb |
551101060091 has 2 divisors, whose sum is σ = 551101060092. Its totient is φ = 551101060090.
The previous prime is 551101060057. The next prime is 551101060109. The reversal of 551101060091 is 190060101155.
Together with next prime (551101060109) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 551101060091 - 238 = 276223153147 is a prime.
It is not a weakly prime, because it can be changed into another prime (551101060591) 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, 275550530045 + 275550530046.
It is an arithmetic number, because the mean of its divisors is an integer number (275550530046).
Almost surely, 2551101060091 is an apocalyptic number.
551101060091 is a deficient number, since it is larger than the sum of its proper divisors (1).
551101060091 is an equidigital number, since it uses as much as digits as its factorization.
551101060091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1350, while the sum is 29.
The spelling of 551101060091 in words is "five hundred fifty-one billion, one hundred one million, sixty thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •