Base | Representation |
---|---|
bin | 111110110110110… |
… | …110001100010110 |
3 | 2201111100110102020 |
4 | 332312312030112 |
5 | 4124432041032 |
6 | 252350554010 |
7 | 35063440641 |
oct | 7666661426 |
9 | 2644313366 |
10 | 1054565142 |
11 | 4a1302444 |
12 | 255208906 |
13 | 13a633457 |
14 | a00b2a58 |
15 | 628adb2c |
hex | 3edb6316 |
1054565142 has 8 divisors (see below), whose sum is σ = 2109130296. Its totient is φ = 351521712.
The previous prime is 1054565137. The next prime is 1054565147. The reversal of 1054565142 is 2415654501.
It is an interprime number because it is at equal distance from previous prime (1054565137) and next prime (1054565147).
It is a sphenic number, since it is the product of 3 distinct primes.
1054565142 is an admirable number.
It is a super-2 number, since 2×10545651422 = 2224215277442960328, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1054565147) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 87880423 + ... + 87880434.
It is an arithmetic number, because the mean of its divisors is an integer number (263641287).
Almost surely, 21054565142 is an apocalyptic number.
1054565142 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1054565142 is a wasteful number, since it uses less digits than its factorization.
1054565142 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 175760862.
The product of its (nonzero) digits is 24000, while the sum is 33.
The square root of 1054565142 is about 32474.0687626297. The cubic root of 1054565142 is about 1017.8672410610.
The spelling of 1054565142 in words is "one billion, fifty-four million, five hundred sixty-five thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •