Base | Representation |
---|---|
bin | 101010001011010… |
… | …0011110100000001 |
3 | 10122121221121102212 |
4 | 1110112203310001 |
5 | 10344242400001 |
6 | 352232351505 |
7 | 50033000345 |
oct | 12426436401 |
9 | 3577847385 |
10 | 1415200001 |
11 | 666930786 |
12 | 335b45595 |
13 | 197271167 |
14 | d5d4b625 |
15 | 843987bb |
hex | 545a3d01 |
1415200001 has 2 divisors, whose sum is σ = 1415200002. Its totient is φ = 1415200000.
The previous prime is 1415199967. The next prime is 1415200141. The reversal of 1415200001 is 1000025141.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1061195776 + 354004225 = 32576^2 + 18815^2 .
It is an emirp because it is prime and its reverse (1000025141) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1415200001 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1415200201) 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, 707600000 + 707600001.
It is an arithmetic number, because the mean of its divisors is an integer number (707600001).
Almost surely, 21415200001 is an apocalyptic number.
It is an amenable number.
1415200001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1415200001 is an equidigital number, since it uses as much as digits as its factorization.
1415200001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40, while the sum is 14.
The square root of 1415200001 is about 37619.1440758558. The cubic root of 1415200001 is about 1122.7229666061.
Adding to 1415200001 its reverse (1000025141), we get a palindrome (2415225142).
The spelling of 1415200001 in words is "one billion, four hundred fifteen million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •