Base | Representation |
---|---|
bin | 101010010101100110… |
… | …0110011101110100111 |
3 | 22200200022022101002212 |
4 | 1110223030303232213 |
5 | 2442200241403421 |
6 | 105433451354035 |
7 | 6366026344322 |
oct | 1245314635647 |
9 | 280608271085 |
10 | 90919091111 |
11 | 35616502922 |
12 | 1575475291b |
13 | 875c371484 |
14 | 4586dc77b9 |
15 | 2571dc9e5b |
hex | 152b333ba7 |
90919091111 has 2 divisors, whose sum is σ = 90919091112. Its totient is φ = 90919091110.
The previous prime is 90919091063. The next prime is 90919091129. The reversal of 90919091111 is 11119091909.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-90919091111 is a prime.
It is a super-2 number, since 2×909190911112 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (90919091141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 45459545555 + 45459545556.
It is an arithmetic number, because the mean of its divisors is an integer number (45459545556).
Almost surely, 290919091111 is an apocalyptic number.
90919091111 is a deficient number, since it is larger than the sum of its proper divisors (1).
90919091111 is an equidigital number, since it uses as much as digits as its factorization.
90919091111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6561, while the sum is 41.
The spelling of 90919091111 in words is "ninety billion, nine hundred nineteen million, ninety-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •