Base | Representation |
---|---|
bin | 10100010101111101… |
… | …00011100100010011 |
3 | 1001012010220012120201 |
4 | 22022332203210103 |
5 | 134331411322021 |
6 | 5003423320031 |
7 | 534434655244 |
oct | 121276434423 |
9 | 31163805521 |
10 | 10921589011 |
11 | 46a4a52523 |
12 | 2149750017 |
13 | 1050902608 |
14 | 7586dcccb |
15 | 43dc51591 |
hex | 28afa3913 |
10921589011 has 2 divisors, whose sum is σ = 10921589012. Its totient is φ = 10921589010.
The previous prime is 10921589009. The next prime is 10921589017. The reversal of 10921589011 is 11098512901.
10921589011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10921589011 - 21 = 10921589009 is a prime.
It is a super-2 number, since 2×109215890112 (a number of 21 digits) contains 22 as substring.
Together with 10921589009, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10921589017) 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, 5460794505 + 5460794506.
It is an arithmetic number, because the mean of its divisors is an integer number (5460794506).
Almost surely, 210921589011 is an apocalyptic number.
10921589011 is a deficient number, since it is larger than the sum of its proper divisors (1).
10921589011 is an equidigital number, since it uses as much as digits as its factorization.
10921589011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6480, while the sum is 37.
The spelling of 10921589011 in words is "ten billion, nine hundred twenty-one million, five hundred eighty-nine thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •