Base | Representation |
---|---|
bin | 1111000110101… |
… | …11011101011000 |
3 | 22211102121200201 |
4 | 13203113131120 |
5 | 224414233030 |
6 | 20323511544 |
7 | 3066013456 |
oct | 743273530 |
9 | 284377621 |
10 | 126711640 |
11 | 65586370 |
12 | 365285b4 |
13 | 20336b03 |
14 | 12b859d6 |
15 | b1ce2ca |
hex | 78d7758 |
126711640 has 64 divisors (see below), whose sum is σ = 316185120. Its totient is φ = 45312000.
The previous prime is 126711617. The next prime is 126711667. The reversal of 126711640 is 46117621.
It is a super-2 number, since 2×1267116402 = 32111679422979200, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 126711599 and 126711608.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24480 + ... + 29200.
Almost surely, 2126711640 is an apocalyptic number.
126711640 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 126711640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (158092560).
126711640 is an abundant number, since it is smaller than the sum of its proper divisors (189473480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126711640 is a wasteful number, since it uses less digits than its factorization.
126711640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4804 (or 4800 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 28.
The square root of 126711640 is about 11256.6264928708. The cubic root of 126711640 is about 502.2718484417.
The spelling of 126711640 in words is "one hundred twenty-six million, seven hundred eleven thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •