Search a number
-
+
10158057 = 3271379157
BaseRepresentation
bin100110101111…
…111111101001
3201010002020100
4212233333221
510100024212
61001420013
7152225220
oct46577751
921102210
1010158057
115808998
12349a609
1321487b0
1414c5cb7
15d59bdc
hex9affe9

10158057 has 48 divisors (see below), whose sum is σ = 18403840. Its totient is φ = 5256576.

The previous prime is 10158053. The next prime is 10158067. The reversal of 10158057 is 75085101.

It is not a de Polignac number, because 10158057 - 22 = 10158053 is a prime.

It is a super-2 number, since 2×101580572 = 206372244030498, which contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 10158057.

It is not an unprimeable number, because it can be changed into a prime (10158053) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 64623 + ... + 64779.

Almost surely, 210158057 is an apocalyptic number.

It is an amenable number.

10158057 is a deficient number, since it is larger than the sum of its proper divisors (8245783).

10158057 is a wasteful number, since it uses less digits than its factorization.

10158057 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 262 (or 259 counting only the distinct ones).

The product of its (nonzero) digits is 1400, while the sum is 27.

The square root of 10158057 is about 3187.1706888712. The cubic root of 10158057 is about 216.5726190121.

The spelling of 10158057 in words is "ten million, one hundred fifty-eight thousand, fifty-seven".

Divisors: 1 3 7 9 13 21 39 63 79 91 117 157 237 273 471 553 711 819 1027 1099 1413 1659 2041 3081 3297 4977 6123 7189 9243 9891 12403 14287 18369 21567 37209 42861 64701 86821 111627 128583 161239 260463 483717 781389 1128673 1451151 3386019 10158057