Base | Representation |
---|---|
bin | 111011000111000110… |
… | …0000000111111001011 |
3 | 110010122122012002110102 |
4 | 1312032030000333023 |
5 | 4034433012103102 |
6 | 134152031240015 |
7 | 12112452336221 |
oct | 1661614007713 |
9 | 403578162412 |
10 | 126939566027 |
11 | 4992009185a |
12 | 2072797900b |
13 | bc7cb20961 |
14 | 6202c50b11 |
15 | 347e333402 |
hex | 1d8e300fcb |
126939566027 has 2 divisors, whose sum is σ = 126939566028. Its totient is φ = 126939566026.
The previous prime is 126939565999. The next prime is 126939566077. The reversal of 126939566027 is 720665939621.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (720665939621) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 126939566027 - 226 = 126872457163 is a prime.
It is a super-2 number, since 2×1269395660272 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (126939566077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63469783013 + 63469783014.
It is an arithmetic number, because the mean of its divisors is an integer number (63469783014).
Almost surely, 2126939566027 is an apocalyptic number.
126939566027 is a deficient number, since it is larger than the sum of its proper divisors (1).
126939566027 is an equidigital number, since it uses as much as digits as its factorization.
126939566027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7348320, while the sum is 56.
The spelling of 126939566027 in words is "one hundred twenty-six billion, nine hundred thirty-nine million, five hundred sixty-six thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •