Base | Representation |
---|---|
bin | 1111000011001… |
… | …11101010000100 |
3 | 22210120100111222 |
4 | 13201213222010 |
5 | 224310104300 |
6 | 20310015512 |
7 | 3062065406 |
oct | 741475204 |
9 | 283510458 |
10 | 126253700 |
11 | 652a3301 |
12 | 36347598 |
13 | 20206541 |
14 | 12aa6b76 |
15 | b13d785 |
hex | 7867a84 |
126253700 has 72 divisors (see below), whose sum is σ = 285815040. Its totient is φ = 48355200.
The previous prime is 126253697. The next prime is 126253717. The reversal of 126253700 is 7352621.
It is a self number, because there is not a number n which added to its sum of digits gives 126253700.
It is an unprimeable number.
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, 430754 + ... + 431046.
Almost surely, 2126253700 is an apocalyptic number.
126253700 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 126253700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142907520).
126253700 is an abundant number, since it is smaller than the sum of its proper divisors (159561340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126253700 is a wasteful number, since it uses less digits than its factorization.
126253700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 477 (or 470 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 26.
The square root of 126253700 is about 11236.2671737548. The cubic root of 126253700 is about 501.6660424393. Note that the first 3 decimals are identical.
The spelling of 126253700 in words is "one hundred twenty-six million, two hundred fifty-three thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •