Base | Representation |
---|---|
bin | 111101111111110… |
… | …001111111010001 |
3 | 2200111012002010101 |
4 | 331333301333101 |
5 | 4112233130001 |
6 | 251113332401 |
7 | 34526646661 |
oct | 7577617721 |
9 | 2614162111 |
10 | 1040130001 |
11 | 494143079 |
12 | 250407101 |
13 | 13764ac51 |
14 | 9c1d61a1 |
15 | 614aba01 |
hex | 3dff1fd1 |
1040130001 has 2 divisors, whose sum is σ = 1040130002. Its totient is φ = 1040130000.
The previous prime is 1040129999. The next prime is 1040130029. The reversal of 1040130001 is 1000310401.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 640090000 + 400040001 = 25300^2 + 20001^2 .
It is an emirp because it is prime and its reverse (1000310401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1040130001 - 21 = 1040129999 is a prime.
Together with 1040129999, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1040130001.
It is not a weakly prime, because it can be changed into another prime (1040130101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 520065000 + 520065001.
It is an arithmetic number, because the mean of its divisors is an integer number (520065001).
Almost surely, 21040130001 is an apocalyptic number.
It is an amenable number.
1040130001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1040130001 is an equidigital number, since it uses as much as digits as its factorization.
1040130001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 1040130001 is about 32251.0465101522. The cubic root of 1040130001 is about 1013.2016173612.
Adding to 1040130001 its reverse (1000310401), we get a palindrome (2040440402).
The spelling of 1040130001 in words is "one billion, forty million, one hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •