Base | Representation |
---|---|
bin | 1111011111001111… |
… | …0111110001011110 |
3 | 101201202012110001100 |
4 | 3313303313301132 |
5 | 32003314221032 |
6 | 1524315053530 |
7 | 205012522515 |
oct | 36763676136 |
9 | 11652173040 |
10 | 4157570142 |
11 | 1843926a90 |
12 | 9804412a6 |
13 | 51347119b |
14 | 2b624d67c |
15 | 194eec97c |
hex | f7cf7c5e |
4157570142 has 24 divisors (see below), whose sum is σ = 9826984440. Its totient is φ = 1259869680.
The previous prime is 4157570117. The next prime is 4157570147. The reversal of 4157570142 is 2410757514.
4157570142 is a `hidden beast` number, since 4 + 1 + 575 + 70 + 14 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 4157570097 and 4157570106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4157570147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10498717 + ... + 10499112.
It is an arithmetic number, because the mean of its divisors is an integer number (409457685).
Almost surely, 24157570142 is an apocalyptic number.
4157570142 is an abundant number, since it is smaller than the sum of its proper divisors (5669414298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4157570142 is a wasteful number, since it uses less digits than its factorization.
4157570142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20997848 (or 20997845 counting only the distinct ones).
The product of its (nonzero) digits is 39200, while the sum is 36.
The square root of 4157570142 is about 64479.2225604497. Note that the first 3 decimals coincide. The cubic root of 4157570142 is about 1607.9771080687.
The spelling of 4157570142 in words is "four billion, one hundred fifty-seven million, five hundred seventy thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •