Base | Representation |
---|---|
bin | 11010110001101010… |
… | …00010010100000001 |
3 | 1101002211110211012212 |
4 | 31120311002110001 |
5 | 213420022400001 |
6 | 10334234231505 |
7 | 1016142120041 |
oct | 153065022401 |
9 | 41084424185 |
10 | 14375200001 |
11 | 6107475588 |
12 | 2952285595 |
13 | 1481279306 |
14 | 9a5263721 |
15 | 5920487bb |
hex | 358d42501 |
14375200001 has 2 divisors, whose sum is σ = 14375200002. Its totient is φ = 14375200000.
The previous prime is 14375199997. The next prime is 14375200009. The reversal of 14375200001 is 10000257341.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14262330625 + 112869376 = 119425^2 + 10624^2 .
It is an emirp because it is prime and its reverse (10000257341) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14375200001 - 22 = 14375199997 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14375200001.
It is not a weakly prime, because it can be changed into another prime (14375200009) 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, 7187600000 + 7187600001.
It is an arithmetic number, because the mean of its divisors is an integer number (7187600001).
Almost surely, 214375200001 is an apocalyptic number.
It is an amenable number.
14375200001 is a deficient number, since it is larger than the sum of its proper divisors (1).
14375200001 is an equidigital number, since it uses as much as digits as its factorization.
14375200001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 840, while the sum is 23.
Adding to 14375200001 its reverse (10000257341), we get a palindrome (24375457342).
The spelling of 14375200001 in words is "fourteen billion, three hundred seventy-five million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •