Base | Representation |
---|---|
bin | 10111100101100100… |
… | …00000011111010101 |
3 | 1012200111220122210101 |
4 | 23302302000133111 |
5 | 201413230130234 |
6 | 5452314454101 |
7 | 625542554362 |
oct | 136262003725 |
9 | 35614818711 |
10 | 12663130069 |
11 | 5409009057 |
12 | 2554a34331 |
13 | 126a664c95 |
14 | 881b19469 |
15 | 4e1aad814 |
hex | 2f2c807d5 |
12663130069 has 2 divisors, whose sum is σ = 12663130070. Its totient is φ = 12663130068.
The previous prime is 12663130063. The next prime is 12663130087. The reversal of 12663130069 is 96003136621.
12663130069 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11038233969 + 1624896100 = 105063^2 + 40310^2 .
It is a cyclic number.
It is not a de Polignac number, because 12663130069 - 223 = 12654741461 is a prime.
It is a super-2 number, since 2×126631300692 (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 (12663130063) 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, 6331565034 + 6331565035.
It is an arithmetic number, because the mean of its divisors is an integer number (6331565035).
Almost surely, 212663130069 is an apocalyptic number.
It is an amenable number.
12663130069 is a deficient number, since it is larger than the sum of its proper divisors (1).
12663130069 is an equidigital number, since it uses as much as digits as its factorization.
12663130069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 37.
The spelling of 12663130069 in words is "twelve billion, six hundred sixty-three million, one hundred thirty thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •