Base | Representation |
---|---|
bin | 1111000100011… |
… | …01110100010000 |
3 | 22210212021220212 |
4 | 13202031310100 |
5 | 224330110000 |
6 | 20313223252 |
7 | 3063316163 |
oct | 742156420 |
9 | 283767825 |
10 | 126410000 |
11 | 6539a782 |
12 | 36401b28 |
13 | 2025c722 |
14 | 12b07ada |
15 | b16ec35 |
hex | 788dd10 |
126410000 has 50 divisors (see below), whose sum is σ = 306075462. Its totient is φ = 50560000.
The previous prime is 126409999. The next prime is 126410017. The reversal of 126410000 is 14621.
It can be written as a sum of positive squares in 5 ways, for example, as 96510976 + 29899024 = 9824^2 + 5468^2 .
It is a tau number, because it is divible by the number of its divisors (50).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 3680 + ... + 16320.
Almost surely, 2126410000 is an apocalyptic number.
126410000 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 126410000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (153037731).
126410000 is an abundant number, since it is smaller than the sum of its proper divisors (179665462).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126410000 is an equidigital number, since it uses as much as digits as its factorization.
126410000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12669 (or 12648 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 126410000 is about 11243.2201792903. The cubic root of 126410000 is about 501.8729751674.
Adding to 126410000 its reverse (14621), we get a palindrome (126424621).
The spelling of 126410000 in words is "one hundred twenty-six million, four hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •