Base | Representation |
---|---|
bin | 10100010100101011… |
… | …10100001010110111 |
3 | 1001011101210121111212 |
4 | 22022111310022313 |
5 | 134321143042421 |
6 | 5002402352035 |
7 | 534245124434 |
oct | 121225641267 |
9 | 31141717455 |
10 | 10910909111 |
11 | 4699a18563 |
12 | 214605b61b |
13 | 104b63344b |
14 | 75711cb8b |
15 | 43cd41e5b |
hex | 28a5742b7 |
10910909111 has 16 divisors (see below), whose sum is σ = 11694816000. Its totient is φ = 10143543168.
The previous prime is 10910909101. The next prime is 10910909137. The reversal of 10910909111 is 11190901901.
10910909111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10910909111 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10910909101) 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 in 15 ways as a sum of consecutive naturals, for example, 458636 + ... + 481838.
It is an arithmetic number, because the mean of its divisors is an integer number (730926000).
Almost surely, 210910909111 is an apocalyptic number.
10910909111 is a deficient number, since it is larger than the sum of its proper divisors (783906889).
10910909111 is a wasteful number, since it uses less digits than its factorization.
10910909111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23558.
The product of its (nonzero) digits is 729, while the sum is 32.
The spelling of 10910909111 in words is "ten billion, nine hundred ten million, nine hundred nine thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •