Base | Representation |
---|---|
bin | 1100110110111110110000… |
… | …0110011100101101011001 |
3 | 1212001122110012120222222111 |
4 | 3031233230012130231121 |
5 | 3323122023303001234 |
6 | 50023121200552321 |
7 | 2656326062125201 |
oct | 315575406345531 |
9 | 55048405528874 |
10 | 14138698484569 |
11 | 4561208776a3a |
12 | 17042116226a1 |
13 | 7b7372c9a269 |
14 | 36c460ca3401 |
15 | 197ba7730664 |
hex | cdbec19cb59 |
14138698484569 has 2 divisors, whose sum is σ = 14138698484570. Its totient is φ = 14138698484568.
The previous prime is 14138698484467. The next prime is 14138698484579. The reversal of 14138698484569 is 96548489683141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14127712929225 + 10985555344 = 3758685^2 + 104812^2 .
It is a cyclic number.
It is not a de Polignac number, because 14138698484569 - 27 = 14138698484441 is a prime.
It is a super-2 number, since 2×141386984845692 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14138698484495 and 14138698484504.
It is not a weakly prime, because it can be changed into another prime (14138698484579) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7069349242284 + 7069349242285.
It is an arithmetic number, because the mean of its divisors is an integer number (7069349242285).
Almost surely, 214138698484569 is an apocalyptic number.
It is an amenable number.
14138698484569 is a deficient number, since it is larger than the sum of its proper divisors (1).
14138698484569 is an equidigital number, since it uses as much as digits as its factorization.
14138698484569 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1433272320, while the sum is 76.
The spelling of 14138698484569 in words is "fourteen trillion, one hundred thirty-eight billion, six hundred ninety-eight million, four hundred eighty-four thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •