Base | Representation |
---|---|
bin | 10010110101010111… |
… | …00011100111001011 |
3 | 222002200012100220001 |
4 | 21122223203213023 |
5 | 131201443131331 |
6 | 4351200143431 |
7 | 505365435562 |
oct | 113253434713 |
9 | 28080170801 |
10 | 10111302091 |
11 | 4319625a10 |
12 | 1b62307b77 |
13 | c51a8a3b7 |
14 | 6bcc56bd9 |
15 | 3e2a46561 |
hex | 25aae39cb |
10111302091 has 4 divisors (see below), whose sum is σ = 11030511384. Its totient is φ = 9192092800.
The previous prime is 10111302077. The next prime is 10111302101. The reversal of 10111302091 is 19020311101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 19020311101 = 11 ⋅1729119191.
It is not a de Polignac number, because 10111302091 - 221 = 10109204939 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10111302011) 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 in 3 ways as a sum of consecutive naturals, for example, 459604630 + ... + 459604651.
It is an arithmetic number, because the mean of its divisors is an integer number (2757627846).
Almost surely, 210111302091 is an apocalyptic number.
10111302091 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10111302091 is a deficient number, since it is larger than the sum of its proper divisors (919209293).
10111302091 is an equidigital number, since it uses as much as digits as its factorization.
10111302091 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 919209292.
The product of its (nonzero) digits is 54, while the sum is 19.
Adding to 10111302091 its reverse (19020311101), we get a palindrome (29131613192).
The spelling of 10111302091 in words is "ten billion, one hundred eleven million, three hundred two thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •