Base | Representation |
---|---|
bin | 111100000010000… |
… | …0001111101000101 |
3 | 12012101022012000002 |
4 | 1320010001331011 |
5 | 13111131310001 |
6 | 531513531045 |
7 | 100626313232 |
oct | 17004017505 |
9 | 5171265002 |
10 | 2014322501 |
11 | 94403a344 |
12 | 482713a85 |
13 | 261420509 |
14 | 151746789 |
15 | bbc9146b |
hex | 78101f45 |
2014322501 has 2 divisors, whose sum is σ = 2014322502. Its totient is φ = 2014322500.
The previous prime is 2014322473. The next prime is 2014322509. The reversal of 2014322501 is 1052234102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1223250625 + 791071876 = 34975^2 + 28126^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2014322501 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2014322509) 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, 1007161250 + 1007161251.
It is an arithmetic number, because the mean of its divisors is an integer number (1007161251).
Almost surely, 22014322501 is an apocalyptic number.
It is an amenable number.
2014322501 is a deficient number, since it is larger than the sum of its proper divisors (1).
2014322501 is an equidigital number, since it uses as much as digits as its factorization.
2014322501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 20.
The square root of 2014322501 is about 44881.2043176205. The cubic root of 2014322501 is about 1262.9214358298.
Adding to 2014322501 its reverse (1052234102), we get a palindrome (3066556603).
The spelling of 2014322501 in words is "two billion, fourteen million, three hundred twenty-two thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •