Base | Representation |
---|---|
bin | 111011000010011010… |
… | …0101111101110011101 |
3 | 110010020200120211200122 |
4 | 1312010310233232131 |
5 | 4034122303033234 |
6 | 134124300204325 |
7 | 12105534136352 |
oct | 1660464575635 |
9 | 403220524618 |
10 | 126782471069 |
11 | 4984a444011 |
12 | 206a32396a5 |
13 | bc56409567 |
14 | 61ca03a629 |
15 | 347065192e |
hex | 1d84d2fb9d |
126782471069 has 2 divisors, whose sum is σ = 126782471070. Its totient is φ = 126782471068.
The previous prime is 126782471009. The next prime is 126782471093. The reversal of 126782471069 is 960174287621.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99247051225 + 27535419844 = 315035^2 + 165938^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-126782471069 is a prime.
It is a super-2 number, since 2×1267824710692 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 126782471069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (126782471009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63391235534 + 63391235535.
It is an arithmetic number, because the mean of its divisors is an integer number (63391235535).
Almost surely, 2126782471069 is an apocalyptic number.
It is an amenable number.
126782471069 is a deficient number, since it is larger than the sum of its proper divisors (1).
126782471069 is an equidigital number, since it uses as much as digits as its factorization.
126782471069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2032128, while the sum is 53.
The spelling of 126782471069 in words is "one hundred twenty-six billion, seven hundred eighty-two million, four hundred seventy-one thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •