Base | Representation |
---|---|
bin | 11100101001110001110111… |
… | …100000100110110101110111 |
3 | 121112012001012210021001222100 |
4 | 130221301313200212311313 |
5 | 113004122433422013142 |
6 | 1124003035424433143 |
7 | 35354244342154341 |
oct | 3451616740466567 |
9 | 545161183231870 |
10 | 126016345501047 |
11 | 37175260883511 |
12 | 1217298b1787b3 |
13 | 55413a0cb2181 |
14 | 231931ba4a291 |
15 | e87e935ceb4c |
hex | 729c77826d77 |
126016345501047 has 12 divisors (see below), whose sum is σ = 182152796567040. Its totient is φ = 83951272508928.
The previous prime is 126016345500953. The next prime is 126016345501049. The reversal of 126016345501047 is 740105543610621.
It is a happy number.
126016345501047 is a `hidden beast` number, since 1 + 2 + 6 + 0 + 1 + 63 + 45 + 501 + 0 + 47 = 666.
It is not a de Polignac number, because 126016345501047 - 28 = 126016345500791 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 126016345500993 and 126016345501011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126016345501049) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4968694263 + ... + 4968719624.
It is an arithmetic number, because the mean of its divisors is an integer number (15179399713920).
Almost surely, 2126016345501047 is an apocalyptic number.
126016345501047 is a deficient number, since it is larger than the sum of its proper divisors (56136451065993).
126016345501047 is a wasteful number, since it uses less digits than its factorization.
126016345501047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9937415302 (or 9937415299 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 45.
The spelling of 126016345501047 in words is "one hundred twenty-six trillion, sixteen billion, three hundred forty-five million, five hundred one thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •