Base | Representation |
---|---|
bin | 1111000001110… |
… | …10110100101000 |
3 | 22210020000121100 |
4 | 13200322310220 |
5 | 224233220211 |
6 | 20302041400 |
7 | 3060402120 |
oct | 740726450 |
9 | 283200540 |
10 | 126070056 |
11 | 65188332 |
12 | 36279260 |
13 | 20170a88 |
14 | 12a59c80 |
15 | b104156 |
hex | 783ad28 |
126070056 has 96 divisors (see below), whose sum is σ = 402854400. Its totient is φ = 34853760.
The previous prime is 126070031. The next prime is 126070057. The reversal of 126070056 is 650070621.
126070056 is a `hidden beast` number, since 1 + 2 + 607 + 0 + 0 + 56 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126070057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11590 + ... + 19658.
It is an arithmetic number, because the mean of its divisors is an integer number (4196400).
Almost surely, 2126070056 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 126070056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (201427200).
126070056 is an abundant number, since it is smaller than the sum of its proper divisors (276784344).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126070056 is a wasteful number, since it uses less digits than its factorization.
126070056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8119 (or 8112 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 126070056 is about 11228.0922689476. The cubic root of 126070056 is about 501.4226894036.
The spelling of 126070056 in words is "one hundred twenty-six million, seventy thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •