Base | Representation |
---|---|
bin | 1111000010001… |
… | …10100010101110 |
3 | 22210022110110100 |
4 | 13201012202232 |
5 | 224241234222 |
6 | 20303051530 |
7 | 3060662100 |
oct | 741064256 |
9 | 283273410 |
10 | 126118062 |
11 | 65210404 |
12 | 362a0ba6 |
13 | 20189895 |
14 | 12a6d570 |
15 | b1134ac |
hex | 78468ae |
126118062 has 72 divisors (see below), whose sum is σ = 331742736. Its totient is φ = 34461504.
The previous prime is 126118037. The next prime is 126118063. The reversal of 126118062 is 260811621.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126118063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 17178 + ... + 23394.
It is an arithmetic number, because the mean of its divisors is an integer number (4607538).
Almost surely, 2126118062 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 126118062, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (165871368).
126118062 is an abundant number, since it is smaller than the sum of its proper divisors (205624674).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126118062 is a wasteful number, since it uses less digits than its factorization.
126118062 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6262 (or 6252 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 27.
The square root of 126118062 is about 11230.2298284585. The cubic root of 126118062 is about 501.4863266216.
Adding to 126118062 its reverse (260811621), we get a palindrome (386929683).
The spelling of 126118062 in words is "one hundred twenty-six million, one hundred eighteen thousand, sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •