Base | Representation |
---|---|
bin | 1101011011101011000001… |
… | …0110001001110000101001 |
3 | 1221021220111220202210101222 |
4 | 3112322300112021300221 |
5 | 3413434011334121214 |
6 | 51224451041351425 |
7 | 3053012660020016 |
oct | 326726026116051 |
9 | 57256456683358 |
10 | 14769056160809 |
11 | 47845811a0a65 |
12 | 17a6413038575 |
13 | 8319401329b2 |
14 | 390b7cc9a70d |
15 | 1a929c7ca38e |
hex | d6eb0589c29 |
14769056160809 has 2 divisors, whose sum is σ = 14769056160810. Its totient is φ = 14769056160808.
The previous prime is 14769056160779. The next prime is 14769056160839. The reversal of 14769056160809 is 90806165096741.
It is a balanced prime because it is at equal distance from previous prime (14769056160779) and next prime (14769056160839).
It can be written as a sum of positive squares in only one way, i.e., 14637702105625 + 131354055184 = 3825925^2 + 362428^2 .
It is a cyclic number.
It is not a de Polignac number, because 14769056160809 - 220 = 14769055112233 is a prime.
It is a super-2 number, since 2×147690561608092 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (14769056160839) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7384528080404 + 7384528080405.
It is an arithmetic number, because the mean of its divisors is an integer number (7384528080405).
Almost surely, 214769056160809 is an apocalyptic number.
It is an amenable number.
14769056160809 is a deficient number, since it is larger than the sum of its proper divisors (1).
14769056160809 is an equidigital number, since it uses as much as digits as its factorization.
14769056160809 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19595520, while the sum is 62.
The spelling of 14769056160809 in words is "fourteen trillion, seven hundred sixty-nine billion, fifty-six million, one hundred sixty thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •