Base | Representation |
---|---|
bin | 11011001100011010… |
… | …11111010101011101 |
3 | 1101200110221022201101 |
4 | 31212031133111131 |
5 | 214400011323031 |
6 | 10412414313101 |
7 | 1024536344155 |
oct | 154615372535 |
9 | 41613838641 |
10 | 14599714141 |
11 | 6212181361 |
12 | 29b54b8791 |
13 | 14b893760c |
14 | 9c6dc7765 |
15 | 5a6ae6361 |
hex | 36635f55d |
14599714141 has 2 divisors, whose sum is σ = 14599714142. Its totient is φ = 14599714140.
The previous prime is 14599714139. The next prime is 14599714147. The reversal of 14599714141 is 14141799541.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14514225625 + 85488516 = 120475^2 + 9246^2 .
It is a cyclic number.
It is not a de Polignac number, because 14599714141 - 21 = 14599714139 is a prime.
Together with 14599714139, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 14599714091 and 14599714100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14599714147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7299857070 + 7299857071.
It is an arithmetic number, because the mean of its divisors is an integer number (7299857071).
Almost surely, 214599714141 is an apocalyptic number.
It is an amenable number.
14599714141 is a deficient number, since it is larger than the sum of its proper divisors (1).
14599714141 is an equidigital number, since it uses as much as digits as its factorization.
14599714141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 181440, while the sum is 46.
The spelling of 14599714141 in words is "fourteen billion, five hundred ninety-nine million, seven hundred fourteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •