Base | Representation |
---|---|
bin | 11100110100011010101001… |
… | …011011100010110101001101 |
3 | 121121202221000011210211010211 |
4 | 130310122221123202311031 |
5 | 113103112011313200041 |
6 | 1125322530213202421 |
7 | 35461122634342531 |
oct | 3464325133426515 |
9 | 547687004724124 |
10 | 126747327475021 |
11 | 37427270077780 |
12 | 12270593630411 |
13 | 55952b60ac596 |
14 | 2342863973bc1 |
15 | e9bec75d1481 |
hex | 7346a96e2d4d |
126747327475021 has 8 divisors (see below), whose sum is σ = 138270554499744. Its totient is φ = 115224224235120.
The previous prime is 126747327474959. The next prime is 126747327475051. The reversal of 126747327475021 is 120574723747621.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-126747327475021 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126747327475051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28798771 + ... + 32906896.
It is an arithmetic number, because the mean of its divisors is an integer number (17283819312468).
Almost surely, 2126747327475021 is an apocalyptic number.
126747327475021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
126747327475021 is a deficient number, since it is larger than the sum of its proper divisors (11523227024723).
126747327475021 is a wasteful number, since it uses less digits than its factorization.
126747327475021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61892411.
The product of its (nonzero) digits is 27659520, while the sum is 58.
The spelling of 126747327475021 in words is "one hundred twenty-six trillion, seven hundred forty-seven billion, three hundred twenty-seven million, four hundred seventy-five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •