Base | Representation |
---|---|
bin | 10110101011100010… |
… | …01100011010101001 |
3 | 1011102121000001210221 |
4 | 23111301030122221 |
5 | 144414123040023 |
6 | 5332130010041 |
7 | 610512333616 |
oct | 132561143251 |
9 | 34377001727 |
10 | 12176377513 |
11 | 518927a713 |
12 | 2439a16921 |
13 | 11c086a911 |
14 | 83721150d |
15 | 4b3eb085d |
hex | 2d5c4c6a9 |
12176377513 has 2 divisors, whose sum is σ = 12176377514. Its totient is φ = 12176377512.
The previous prime is 12176377481. The next prime is 12176377541. The reversal of 12176377513 is 31577367121.
12176377513 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., 6404480784 + 5771896729 = 80028^2 + 75973^2 .
It is a cyclic number.
It is not a de Polignac number, because 12176377513 - 25 = 12176377481 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12176377513.
It is not a weakly prime, because it can be changed into another prime (12176371513) 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, 6088188756 + 6088188757.
It is an arithmetic number, because the mean of its divisors is an integer number (6088188757).
Almost surely, 212176377513 is an apocalyptic number.
It is an amenable number.
12176377513 is a deficient number, since it is larger than the sum of its proper divisors (1).
12176377513 is an equidigital number, since it uses as much as digits as its factorization.
12176377513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 185220, while the sum is 43.
The spelling of 12176377513 in words is "twelve billion, one hundred seventy-six million, three hundred seventy-seven thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •