Base | Representation |
---|---|
bin | 11000000001011111… |
… | …11000001001111101 |
3 | 1020021211211110222012 |
4 | 30000233320021331 |
5 | 202403221441134 |
6 | 5531445101005 |
7 | 634416352553 |
oct | 140057701175 |
9 | 36254743865 |
10 | 12897452669 |
11 | 55193040a2 |
12 | 25bb3b7765 |
13 | 12a70788ca |
14 | 8a4cb3bd3 |
15 | 5074476ce |
hex | 300bf827d |
12897452669 has 2 divisors, whose sum is σ = 12897452670. Its totient is φ = 12897452668.
The previous prime is 12897452597. The next prime is 12897452693. The reversal of 12897452669 is 96625479821.
It is a happy number.
12897452669 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12831225625 + 66227044 = 113275^2 + 8138^2 .
It is a cyclic number.
It is not a de Polignac number, because 12897452669 - 212 = 12897448573 is a prime.
It is a super-2 number, since 2×128974526692 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12897452969) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6448726334 + 6448726335.
It is an arithmetic number, because the mean of its divisors is an integer number (6448726335).
Almost surely, 212897452669 is an apocalyptic number.
It is an amenable number.
12897452669 is a deficient number, since it is larger than the sum of its proper divisors (1).
12897452669 is an equidigital number, since it uses as much as digits as its factorization.
12897452669 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 13063680, while the sum is 59.
The spelling of 12897452669 in words is "twelve billion, eight hundred ninety-seven million, four hundred fifty-two thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •