Base | Representation |
---|---|
bin | 111011000011010101… |
… | …1010100111011101001 |
3 | 110010022212002010211022 |
4 | 1312012223110323221 |
5 | 4034203232301312 |
6 | 134131330342225 |
7 | 12106362305330 |
oct | 1660653247351 |
9 | 403285063738 |
10 | 126813556457 |
11 | 49865a45a15 |
12 | 206b172a975 |
13 | bc5c9a1593 |
14 | 61d020cd17 |
15 | 3473242172 |
hex | 1d86ad4ee9 |
126813556457 has 4 divisors (see below), whose sum is σ = 144929778816. Its totient is φ = 108697334100.
The previous prime is 126813556451. The next prime is 126813556487. The reversal of 126813556457 is 754655318621.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 754655318621 = 242129 ⋅3116749.
It is a cyclic number.
It is not a de Polignac number, because 126813556457 - 26 = 126813556393 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 126813556399 and 126813556408.
It is not an unprimeable number, because it can be changed into a prime (126813556451) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9058111169 + ... + 9058111182.
It is an arithmetic number, because the mean of its divisors is an integer number (36232444704).
Almost surely, 2126813556457 is an apocalyptic number.
It is an amenable number.
126813556457 is a deficient number, since it is larger than the sum of its proper divisors (18116222359).
126813556457 is an equidigital number, since it uses as much as digits as its factorization.
126813556457 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18116222358.
The product of its digits is 6048000, while the sum is 53.
The spelling of 126813556457 in words is "one hundred twenty-six billion, eight hundred thirteen million, five hundred fifty-six thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •