Base | Representation |
---|---|
bin | 111100011100001… |
… | …001100001100001 |
3 | 2121200001010222001 |
4 | 330130021201201 |
5 | 4034041341001 |
6 | 244341444001 |
7 | 34061650132 |
oct | 7434114141 |
9 | 2550033861 |
10 | 1014012001 |
11 | 480424252 |
12 | 243710601 |
13 | 132104c02 |
14 | 98957c89 |
15 | 5e04d001 |
hex | 3c709861 |
1014012001 has 2 divisors, whose sum is σ = 1014012002. Its totient is φ = 1014012000.
The previous prime is 1014011983. The next prime is 1014012019. The reversal of 1014012001 is 1002104101.
It is a balanced prime because it is at equal distance from previous prime (1014011983) and next prime (1014012019).
It can be written as a sum of positive squares in only one way, i.e., 704955601 + 309056400 = 26551^2 + 17580^2 .
It is a cyclic number.
It is not a de Polignac number, because 1014012001 - 215 = 1013979233 is a prime.
It is not a weakly prime, because it can be changed into another prime (1014012061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 507006000 + 507006001.
It is an arithmetic number, because the mean of its divisors is an integer number (507006001).
Almost surely, 21014012001 is an apocalyptic number.
It is an amenable number.
1014012001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1014012001 is an equidigital number, since it uses as much as digits as its factorization.
1014012001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 10.
The square root of 1014012001 is about 31843.5550936135. Note that the first 3 decimals coincide. The cubic root of 1014012001 is about 1004.6490201182.
Adding to 1014012001 its reverse (1002104101), we get a palindrome (2016116102).
The spelling of 1014012001 in words is "one billion, fourteen million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •