Base | Representation |
---|---|
bin | 111011000001010101… |
… | …1001101000111000001 |
3 | 110010011011202000211011 |
4 | 1312002223031013001 |
5 | 4034034040244203 |
6 | 134120531320521 |
7 | 12104615520262 |
oct | 1660253150701 |
9 | 403134660734 |
10 | 126746415553 |
11 | 49831057a6a |
12 | 20693150141 |
13 | bc4bac4234 |
14 | 61c5332969 |
15 | 346c3cd76d |
hex | 1d82acd1c1 |
126746415553 has 4 divisors (see below), whose sum is σ = 128350800640. Its totient is φ = 125142030468.
The previous prime is 126746415533. The next prime is 126746415557. The reversal of 126746415553 is 355514647621.
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.
It is a cyclic number.
It is not a de Polignac number, because 126746415553 - 221 = 126744318401 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 126746415497 and 126746415506.
It is not an unprimeable number, because it can be changed into a prime (126746415557) 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 in 3 ways as a sum of consecutive naturals, for example, 802192425 + ... + 802192582.
It is an arithmetic number, because the mean of its divisors is an integer number (32087700160).
Almost surely, 2126746415553 is an apocalyptic number.
It is an amenable number.
126746415553 is a deficient number, since it is larger than the sum of its proper divisors (1604385087).
126746415553 is an equidigital number, since it uses as much as digits as its factorization.
126746415553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1604385086.
The product of its digits is 3024000, while the sum is 49.
The spelling of 126746415553 in words is "one hundred twenty-six billion, seven hundred forty-six million, four hundred fifteen thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •