Base | Representation |
---|---|
bin | 111011000000001001… |
… | …1110000111111110100 |
3 | 110010001102001010011210 |
4 | 1312000103300333310 |
5 | 4033443404413120 |
6 | 134112552401420 |
7 | 12103624215126 |
oct | 1660023607764 |
9 | 403042033153 |
10 | 126706716660 |
11 | 49810702667 |
12 | 206819a6270 |
13 | bc43804774 |
14 | 61bdd5b216 |
15 | 3468b8ace0 |
hex | 1d804f0ff4 |
126706716660 has 96 divisors (see below), whose sum is σ = 358280036352. Its totient is φ = 33456551040.
The previous prime is 126706716649. The next prime is 126706716673. The reversal of 126706716660 is 66617607621.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2626477 + ... + 2674283.
It is an arithmetic number, because the mean of its divisors is an integer number (3732083712).
Almost surely, 2126706716660 is an apocalyptic number.
126706716660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 126706716660, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (179140018176).
126706716660 is an abundant number, since it is smaller than the sum of its proper divisors (231573319692).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126706716660 is a wasteful number, since it uses less digits than its factorization.
126706716660 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48253 (or 48251 counting only the distinct ones).
The product of its (nonzero) digits is 762048, while the sum is 48.
The spelling of 126706716660 in words is "one hundred twenty-six billion, seven hundred six million, seven hundred sixteen thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •