Base | Representation |
---|---|
bin | 111100011100001… |
… | …001100001101011 |
3 | 2121200001010222102 |
4 | 330130021201223 |
5 | 4034041341021 |
6 | 244341444015 |
7 | 34061650145 |
oct | 7434114153 |
9 | 2550033872 |
10 | 1014012011 |
11 | 480424261 |
12 | 24371060b |
13 | 132104c0c |
14 | 98957c95 |
15 | 5e04d00b |
hex | 3c70986b |
1014012011 has 4 divisors (see below), whose sum is σ = 1015036224. Its totient is φ = 1012987800.
The previous prime is 1014012001. The next prime is 1014012019. The reversal of 1014012011 is 1102104101.
1014012011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1014012011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1014011983 and 1014012001.
It is not an unprimeable number, because it can be changed into a prime (1014012019) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 510620 + ... + 512601.
It is an arithmetic number, because the mean of its divisors is an integer number (253759056).
Almost surely, 21014012011 is an apocalyptic number.
1014012011 is a deficient number, since it is larger than the sum of its proper divisors (1024213).
1014012011 is an equidigital number, since it uses as much as digits as its factorization.
1014012011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1024212.
The product of its (nonzero) digits is 8, while the sum is 11.
The square root of 1014012011 is about 31843.5552506312. Note that the first 3 decimals coincide. The cubic root of 1014012011 is about 1004.6490234208.
Adding to 1014012011 its reverse (1102104101), we get a palindrome (2116116112).
The spelling of 1014012011 in words is "one billion, fourteen million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •