Base | Representation |
---|---|
bin | 1110111001101011… |
… | …0101101001100101 |
3 | 101022202201201010222 |
4 | 3232122311221211 |
5 | 31143000403101 |
6 | 1500530054125 |
7 | 201060356123 |
oct | 35632655145 |
9 | 11282651128 |
10 | 4000012901 |
11 | 17729a2995 |
12 | 93771a345 |
13 | 4b9927551 |
14 | 29d358913 |
15 | 18627901b |
hex | ee6b5a65 |
4000012901 has 2 divisors, whose sum is σ = 4000012902. Its totient is φ = 4000012900.
The previous prime is 4000012889. The next prime is 4000012927. The reversal of 4000012901 is 1092100004.
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., 2110024225 + 1889988676 = 45935^2 + 43474^2 .
It is a cyclic number.
It is not a de Polignac number, because 4000012901 - 26 = 4000012837 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4000012901.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4000018901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2000006450 + 2000006451.
It is an arithmetic number, because the mean of its divisors is an integer number (2000006451).
Almost surely, 24000012901 is an apocalyptic number.
It is an amenable number.
4000012901 is a deficient number, since it is larger than the sum of its proper divisors (1).
4000012901 is an equidigital number, since it uses as much as digits as its factorization.
4000012901 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 4000012901 is about 63245.6551946456. The cubic root of 4000012901 is about 1587.4027585548.
Adding to 4000012901 its reverse (1092100004), we get a palindrome (5092112905).
The spelling of 4000012901 in words is "four billion, twelve thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •