Base | Representation |
---|---|
bin | 1111000101111… |
… | …10101100011000 |
3 | 22211020110112200 |
4 | 13202332230120 |
5 | 224403011300 |
6 | 20321410200 |
7 | 3065111643 |
oct | 742765430 |
9 | 284213480 |
10 | 126610200 |
11 | 65517132 |
12 | 36499960 |
13 | 202cc8a2 |
14 | 12b5aa5a |
15 | b1ae200 |
hex | 78beb18 |
126610200 has 144 divisors (see below), whose sum is σ = 439108800. Its totient is φ = 32659200.
The previous prime is 126610153. The next prime is 126610213. The reversal of 126610200 is 2016621.
It is a happy number.
126610200 is a `hidden beast` number, since 1 + 2 + 661 + 0 + 2 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 54666 + ... + 56934.
Almost surely, 2126610200 is an apocalyptic number.
126610200 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 126610200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (219554400).
126610200 is an abundant number, since it is smaller than the sum of its proper divisors (312498600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126610200 is a wasteful number, since it uses less digits than its factorization.
126610200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2322 (or 2310 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
The square root of 126610200 is about 11252.1198002865. The cubic root of 126610200 is about 502.1377800993.
Adding to 126610200 its reverse (2016621), we get a palindrome (128626821).
The spelling of 126610200 in words is "one hundred twenty-six million, six hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •