Base | Representation |
---|---|
bin | 1011011110100101011110… |
… | …0100011000011110001001 |
3 | 1122200110122021202212022211 |
4 | 2313221113210120132021 |
5 | 3123231412231231412 |
6 | 42501330334145121 |
7 | 2441525265110353 |
oct | 267512744303611 |
9 | 48613567685284 |
10 | 12620083070857 |
11 | 4026168985819 |
12 | 14b9a343521a1 |
13 | 7070b7cbba72 |
14 | 318b5b1b00d3 |
15 | 16d425e67ca7 |
hex | b7a57918789 |
12620083070857 has 2 divisors, whose sum is σ = 12620083070858. Its totient is φ = 12620083070856.
The previous prime is 12620083070809. The next prime is 12620083070893. The reversal of 12620083070857 is 75807038002621.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10297494878841 + 2322588192016 = 3208971^2 + 1524004^2 .
It is a cyclic number.
It is not a de Polignac number, because 12620083070857 - 215 = 12620083038089 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12620083070857.
It is not a weakly prime, because it can be changed into another prime (12620083070657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6310041535428 + 6310041535429.
It is an arithmetic number, because the mean of its divisors is an integer number (6310041535429).
Almost surely, 212620083070857 is an apocalyptic number.
It is an amenable number.
12620083070857 is a deficient number, since it is larger than the sum of its proper divisors (1).
12620083070857 is an equidigital number, since it uses as much as digits as its factorization.
12620083070857 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1128960, while the sum is 49.
The spelling of 12620083070857 in words is "twelve trillion, six hundred twenty billion, eighty-three million, seventy thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •