Base | Representation |
---|---|
bin | 11010001100111001… |
… | …00011100010100001 |
3 | 1100022100011002210212 |
4 | 31012130203202201 |
5 | 212302044330414 |
6 | 10243500103505 |
7 | 1005405523112 |
oct | 150634434241 |
9 | 40270132725 |
10 | 14066792609 |
11 | 5a69379541 |
12 | 2886b34b95 |
13 | 14323c682c |
14 | 976302209 |
15 | 574e2883e |
hex | 3467238a1 |
14066792609 has 2 divisors, whose sum is σ = 14066792610. Its totient is φ = 14066792608.
The previous prime is 14066792603. The next prime is 14066792689. The reversal of 14066792609 is 90629766041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10268782225 + 3798010384 = 101335^2 + 61628^2 .
It is an emirp because it is prime and its reverse (90629766041) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14066792609 is a prime.
It is not a weakly prime, because it can be changed into another prime (14066792603) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7033396304 + 7033396305.
It is an arithmetic number, because the mean of its divisors is an integer number (7033396305).
Almost surely, 214066792609 is an apocalyptic number.
It is an amenable number.
14066792609 is a deficient number, since it is larger than the sum of its proper divisors (1).
14066792609 is an equidigital number, since it uses as much as digits as its factorization.
14066792609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 979776, while the sum is 50.
The spelling of 14066792609 in words is "fourteen billion, sixty-six million, seven hundred ninety-two thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •