Base | Representation |
---|---|
bin | 111100100111010… |
… | …100011010110011 |
3 | 2121212112220201021 |
4 | 330213110122303 |
5 | 4040314041321 |
6 | 244524320311 |
7 | 34125564160 |
oct | 7447243263 |
9 | 2555486637 |
10 | 1016940211 |
11 | 482044261 |
12 | 2446a3097 |
13 | 1328bb991 |
14 | 990bb067 |
15 | 5e42a941 |
hex | 3c9d46b3 |
1016940211 has 32 divisors (see below), whose sum is σ = 1252697600. Its totient is φ = 806215680.
The previous prime is 1016940209. The next prime is 1016940217. The reversal of 1016940211 is 1120496101.
It is a 13-Lehmer number, since φ(1016940211) divides (1016940211-1)13.
It is a cyclic number.
It is not a de Polignac number, because 1016940211 - 21 = 1016940209 is a prime.
It is the 31890-th Hogben number.
It is not an unprimeable number, because it can be changed into a prime (1016940217) by changing a digit.
It is a nontrivial repunit in base 31889.
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 31 ways as a sum of consecutive naturals, for example, 1322035 + ... + 1322803.
It is an arithmetic number, because the mean of its divisors is an integer number (39146800).
Almost surely, 21016940211 is an apocalyptic number.
1016940211 is a deficient number, since it is larger than the sum of its proper divisors (235757389).
1016940211 is a wasteful number, since it uses less digits than its factorization.
1016940211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1019.
The product of its (nonzero) digits is 432, while the sum is 25.
The square root of 1016940211 is about 31889.5000117594. The cubic root of 1016940211 is about 1005.6151480969.
The spelling of 1016940211 in words is "one billion, sixteen million, nine hundred forty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •