Base | Representation |
---|---|
bin | 1111001000001… |
… | …11110111001100 |
3 | 22211210200122200 |
4 | 13210013313030 |
5 | 224442104100 |
6 | 20332041500 |
7 | 3100500465 |
oct | 744076714 |
9 | 284720580 |
10 | 126909900 |
11 | 65701317 |
12 | 36603290 |
13 | 203a6120 |
14 | 12bd7d6c |
15 | b21ce00 |
hex | 7907dcc |
126909900 has 108 divisors (see below), whose sum is σ = 428430912. Its totient is φ = 31236480.
The previous prime is 126909857. The next prime is 126909907. The reversal of 126909900 is 9909621.
It is a super-2 number, since 2×1269099002 = 32212245436020000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (126909907) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 6277 + ... + 17123.
Almost surely, 2126909900 is an apocalyptic number.
126909900 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 126909900, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (214215456).
126909900 is an abundant number, since it is smaller than the sum of its proper divisors (301521012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126909900 is a wasteful number, since it uses less digits than its factorization.
126909900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10880 (or 10870 counting only the distinct ones).
The product of its (nonzero) digits is 8748, while the sum is 36.
The square root of 126909900 is about 11265.4294192454. The cubic root of 126909900 is about 502.5336726526.
The spelling of 126909900 in words is "one hundred twenty-six million, nine hundred nine thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •