Base | Representation |
---|---|
bin | 1111000101101… |
… | …00101010110110 |
3 | 22211011101020000 |
4 | 13202310222312 |
5 | 224400203032 |
6 | 20320452130 |
7 | 3064551150 |
oct | 742645266 |
9 | 284141200 |
10 | 126569142 |
11 | 654992a7 |
12 | 3647a046 |
13 | 202b6cab |
14 | 12b49ad0 |
15 | b1a1e7c |
hex | 78b4ab6 |
126569142 has 80 divisors (see below), whose sum is σ = 326177280. Its totient is φ = 35934192.
The previous prime is 126569117. The next prime is 126569143. The reversal of 126569142 is 241965621.
It is a junction number, because it is equal to n+sod(n) for n = 126569097 and 126569106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (126569143) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 270793 + ... + 271259.
It is an arithmetic number, because the mean of its divisors is an integer number (4077216).
Almost surely, 2126569142 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 126569142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (163088640).
126569142 is an abundant number, since it is smaller than the sum of its proper divisors (199608138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
126569142 is a wasteful number, since it uses less digits than its factorization.
126569142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 727 (or 718 counting only the distinct ones).
The product of its digits is 25920, while the sum is 36.
The square root of 126569142 is about 11250.2951961271. The cubic root of 126569142 is about 502.0834953683.
It can be divided in two parts, 1265 and 69142, that added together give a palindrome (70407).
The spelling of 126569142 in words is "one hundred twenty-six million, five hundred sixty-nine thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •