Base | Representation |
---|---|
bin | 111010111110001101… |
… | …1000000100000100000 |
3 | 110002212212100002102121 |
4 | 1311330123000200200 |
5 | 4033330211200321 |
6 | 134102302554024 |
7 | 12102203020432 |
oct | 1657433004040 |
9 | 402785302377 |
10 | 126641506336 |
11 | 49787913134 |
12 | 20663b98914 |
13 | bc33152087 |
14 | 61b5424652 |
15 | 34630a9441 |
hex | 1d7c6c0820 |
126641506336 has 48 divisors (see below), whose sum is σ = 251466858720. Its totient is φ = 62777827840.
The previous prime is 126641506333. The next prime is 126641506349. The reversal of 126641506336 is 633605146621.
126641506336 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1266415063362 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 126641506292 and 126641506301.
It is not an unprimeable number, because it can be changed into a prime (126641506333) 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, 4584855 + ... + 4612393.
It is an arithmetic number, because the mean of its divisors is an integer number (5238892890).
Almost surely, 2126641506336 is an apocalyptic number.
126641506336 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
126641506336 is a deficient number, since it is larger than the sum of its proper divisors (124825352384).
126641506336 is a wasteful number, since it uses less digits than its factorization.
126641506336 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28777 (or 28769 counting only the distinct ones).
The product of its (nonzero) digits is 466560, while the sum is 43.
The spelling of 126641506336 in words is "one hundred twenty-six billion, six hundred forty-one million, five hundred six thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •