Base | Representation |
---|---|
bin | 11100110010100100101010… |
… | …010010010101100000010110 |
3 | 121121022211000010112200100020 |
4 | 130302210222102111200112 |
5 | 113044023032404200001 |
6 | 1125144415155330010 |
7 | 35446016335216254 |
oct | 3462445222254026 |
9 | 547284003480306 |
10 | 126620640303126 |
11 | 3738856a504412 |
12 | 1224bb182b0906 |
13 | 558637665bc88 |
14 | 233a6864635d4 |
15 | e98a60506736 |
hex | 73292a495816 |
126620640303126 has 8 divisors (see below), whose sum is σ = 253241280606264. Its totient is φ = 42206880101040.
The previous prime is 126620640303121. The next prime is 126620640303167. The reversal of 126620640303126 is 621303046026621.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
126620640303126 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126620640303121) 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, 10551720025255 + ... + 10551720025266.
It is an arithmetic number, because the mean of its divisors is an integer number (31655160075783).
Almost surely, 2126620640303126 is an apocalyptic number.
126620640303126 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126620640303126 is a wasteful number, since it uses less digits than its factorization.
126620640303126 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21103440050526.
The product of its (nonzero) digits is 373248, while the sum is 42.
Adding to 126620640303126 its reverse (621303046026621), we get a palindrome (747923686329747).
The spelling of 126620640303126 in words is "one hundred twenty-six trillion, six hundred twenty billion, six hundred forty million, three hundred three thousand, one hundred twenty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •