Base | Representation |
---|---|
bin | 1111000001101… |
… | …11011111000001 |
3 | 22210012022212000 |
4 | 13200313133001 |
5 | 224232301020 |
6 | 20301454213 |
7 | 3060314220 |
oct | 740673701 |
9 | 283168760 |
10 | 126056385 |
11 | 65179034 |
12 | 36271369 |
13 | 201677a0 |
14 | 12a54cb7 |
15 | b100090 |
hex | 78377c1 |
126056385 has 128 divisors (see below), whose sum is σ = 285573120. Its totient is φ = 51321600.
The previous prime is 126056347. The next prime is 126056387. The reversal of 126056385 is 583650621.
126056385 is a `hidden beast` number, since 12 + 6 + 0 + 5 + 638 + 5 = 666.
It is not a de Polignac number, because 126056385 - 27 = 126056257 is a prime.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (126056387) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 380670 + ... + 381000.
It is an arithmetic number, because the mean of its divisors is an integer number (2231040).
Almost surely, 2126056385 is an apocalyptic number.
126056385 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
126056385 is an abundant number, since it is smaller than the sum of its proper divisors (159516735).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126056385 is a wasteful number, since it uses less digits than its factorization.
126056385 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396 (or 390 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
The square root of 126056385 is about 11227.4834669217. The cubic root of 126056385 is about 501.4045640385.
The spelling of 126056385 in words is "one hundred twenty-six million, fifty-six thousand, three hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •