Base | Representation |
---|---|
bin | 10111100111001000… |
… | …10100011101010001 |
3 | 1012201102201201200102 |
4 | 23303210110131101 |
5 | 201430114202212 |
6 | 5453505302145 |
7 | 626062635263 |
oct | 136344243521 |
9 | 35642651612 |
10 | 12676319057 |
11 | 54154a7146 |
12 | 2559334955 |
13 | 127030220c |
14 | 88378db33 |
15 | 4e2d165c2 |
hex | 2f3914751 |
12676319057 has 2 divisors, whose sum is σ = 12676319058. Its totient is φ = 12676319056.
The previous prime is 12676319023. The next prime is 12676319063. The reversal of 12676319057 is 75091367621.
It is a happy number.
12676319057 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., 12434703121 + 241615936 = 111511^2 + 15544^2 .
It is a cyclic number.
It is not a de Polignac number, because 12676319057 - 216 = 12676253521 is a prime.
It is a super-2 number, since 2×126763190572 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12676310057) 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, 6338159528 + 6338159529.
It is an arithmetic number, because the mean of its divisors is an integer number (6338159529).
Almost surely, 212676319057 is an apocalyptic number.
It is an amenable number.
12676319057 is a deficient number, since it is larger than the sum of its proper divisors (1).
12676319057 is an equidigital number, since it uses as much as digits as its factorization.
12676319057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 476280, while the sum is 47.
The spelling of 12676319057 in words is "twelve billion, six hundred seventy-six million, three hundred nineteen thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •