Base | Representation |
---|---|
bin | 111010110011011111… |
… | …1101000100100000000 |
3 | 110001221210212201120020 |
4 | 1311212333220210000 |
5 | 4032111143240312 |
6 | 134002501413440 |
7 | 12060246235650 |
oct | 1654677504400 |
9 | 401853781506 |
10 | 126282008832 |
11 | 496129a1361 |
12 | 2058370a280 |
13 | bba6821c65 |
14 | 617d7a4360 |
15 | 344174678c |
hex | 1d66fe8900 |
126282008832 has 144 divisors (see below), whose sum is σ = 384699702912. Its totient is φ = 36024975360.
The previous prime is 126282008821. The next prime is 126282008849. The reversal of 126282008832 is 238800282621.
126282008832 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3535768 + ... + 3571304.
Almost surely, 2126282008832 is an apocalyptic number.
126282008832 is a gapful number since it is divisible by the number (12) 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 126282008832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (192349851456).
126282008832 is an abundant number, since it is smaller than the sum of its proper divisors (258417694080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126282008832 is an equidigital number, since it uses as much as digits as its factorization.
126282008832 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36224 (or 36210 counting only the distinct ones).
The product of its (nonzero) digits is 147456, while the sum is 42.
The spelling of 126282008832 in words is "one hundred twenty-six billion, two hundred eighty-two million, eight thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •