Base | Representation |
---|---|
bin | 1111000100100… |
… | …00000000111110 |
3 | 22210212202021102 |
4 | 13202100000332 |
5 | 224330402011 |
6 | 20313333102 |
7 | 3063354350 |
oct | 742200076 |
9 | 283782242 |
10 | 126419006 |
11 | 653a651a |
12 | 36407192 |
13 | 2026385c |
14 | 12b0b0d0 |
15 | b17273b |
hex | 789003e |
126419006 has 8 divisors (see below), whose sum is σ = 216718320. Its totient is φ = 54179568.
The previous prime is 126419003. The next prime is 126419009. The reversal of 126419006 is 600914621.
It is an interprime number because it is at equal distance from previous prime (126419003) and next prime (126419009).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 126419006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126419003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4514951 + ... + 4514978.
It is an arithmetic number, because the mean of its divisors is an integer number (27089790).
Almost surely, 2126419006 is an apocalyptic number.
126419006 is a deficient number, since it is larger than the sum of its proper divisors (90299314).
126419006 is an equidigital number, since it uses as much as digits as its factorization.
126419006 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9029938.
The product of its (nonzero) digits is 2592, while the sum is 29.
The square root of 126419006 is about 11243.6206801902. The cubic root of 126419006 is about 501.8848934246.
It can be divided in two parts, 126 and 419006, that multiplied together give a square (52794756 = 72662).
The spelling of 126419006 in words is "one hundred twenty-six million, four hundred nineteen thousand, six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •