Base | Representation |
---|---|
bin | 11010110010111011… |
… | …11100110111011101 |
3 | 1101010120122201222011 |
4 | 31121131330313131 |
5 | 213430244104342 |
6 | 10335300151221 |
7 | 1016332231021 |
oct | 153135746735 |
9 | 41116581864 |
10 | 14385925597 |
11 | 611253090a |
12 | 2955998511 |
13 | 1483563214 |
14 | 9a6856381 |
15 | 592e66717 |
hex | 35977cddd |
14385925597 has 2 divisors, whose sum is σ = 14385925598. Its totient is φ = 14385925596.
The previous prime is 14385925583. The next prime is 14385925613. The reversal of 14385925597 is 79552958341.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7968954361 + 6416971236 = 89269^2 + 80106^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14385925597 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14385925577) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7192962798 + 7192962799.
It is an arithmetic number, because the mean of its divisors is an integer number (7192962799).
Almost surely, 214385925597 is an apocalyptic number.
It is an amenable number.
14385925597 is a deficient number, since it is larger than the sum of its proper divisors (1).
14385925597 is an equidigital number, since it uses as much as digits as its factorization.
14385925597 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 13608000, while the sum is 58.
The spelling of 14385925597 in words is "fourteen billion, three hundred eighty-five million, nine hundred twenty-five thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •