Base | Representation |
---|---|
bin | 1111000011000… |
… | …10000001101100 |
3 | 22210112011212202 |
4 | 13201202001230 |
5 | 224303340021 |
6 | 20305321032 |
7 | 3061641230 |
oct | 741420154 |
9 | 283464782 |
10 | 126230636 |
11 | 65287a44 |
12 | 36336178 |
13 | 201c8bac |
14 | 12a9c5c0 |
15 | b136a0b |
hex | 786206c |
126230636 has 48 divisors (see below), whose sum is σ = 267036672. Its totient is φ = 51062400.
The previous prime is 126230617. The next prime is 126230639. The reversal of 126230636 is 636032621.
It is a junction number, because it is equal to n+sod(n) for n = 126230599 and 126230608.
It is not an unprimeable number, because it can be changed into a prime (126230639) 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 15 ways as a sum of consecutive naturals, for example, 33815 + ... + 37361.
It is an arithmetic number, because the mean of its divisors is an integer number (5563264).
Almost surely, 2126230636 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 126230636, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (133518336).
126230636 is an abundant number, since it is smaller than the sum of its proper divisors (140806036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126230636 is a wasteful number, since it uses less digits than its factorization.
126230636 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3630 (or 3628 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 29.
The square root of 126230636 is about 11235.2408073882. The cubic root of 126230636 is about 501.6354924957.
The spelling of 126230636 in words is "one hundred twenty-six million, two hundred thirty thousand, six hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •