Base | Representation |
---|---|
bin | 10011110010000111… |
… | …11101000001001011 |
3 | 1000102012022102022021 |
4 | 21321003331001023 |
5 | 133222434422331 |
6 | 4513525105311 |
7 | 524125062442 |
oct | 117103750113 |
9 | 30365272267 |
10 | 10621014091 |
11 | 45603160a6 |
12 | 2084b58237 |
13 | 1003562c2c |
14 | 72a819d59 |
15 | 42267c211 |
hex | 2790fd04b |
10621014091 has 2 divisors, whose sum is σ = 10621014092. Its totient is φ = 10621014090.
The previous prime is 10621014029. The next prime is 10621014109. The reversal of 10621014091 is 19041012601.
10621014091 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with next prime (10621014109) 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 10621014091 - 221 = 10618916939 is a prime.
It is a super-2 number, since 2×106210140912 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10621014011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5310507045 + 5310507046.
It is an arithmetic number, because the mean of its divisors is an integer number (5310507046).
Almost surely, 210621014091 is an apocalyptic number.
10621014091 is a deficient number, since it is larger than the sum of its proper divisors (1).
10621014091 is an equidigital number, since it uses as much as digits as its factorization.
10621014091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 25.
Adding to 10621014091 its reverse (19041012601), we get a palindrome (29662026692).
The spelling of 10621014091 in words is "ten billion, six hundred twenty-one million, fourteen thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •