Search a number
-
+
10145265135 = 353747388931
BaseRepresentation
bin10010111001011010…
…00111010111101111
3222012001002212102120
421130231013113233
5131234141441020
64354412124023
7506260221315
oct113455072757
928161085376
1010145265135
114336812945
121b71766613
13c58b1c185
146c35780b5
153e5a04740
hex25cb475ef

10145265135 has 32 divisors (see below), whose sum is σ = 17025887232. Its totient is φ = 5152544640.

The previous prime is 10145265107. The next prime is 10145265149. The reversal of 10145265135 is 53156254101.

It is not a de Polignac number, because 10145265135 - 25 = 10145265103 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 10145265096 and 10145265105.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 168381 + ... + 220550.

It is an arithmetic number, because the mean of its divisors is an integer number (532058976).

Almost surely, 210145265135 is an apocalyptic number.

10145265135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

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

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

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

The sum of its prime factors is 389023.

The product of its (nonzero) digits is 18000, while the sum is 33.

The spelling of 10145265135 in words is "ten billion, one hundred forty-five million, two hundred sixty-five thousand, one hundred thirty-five".

Divisors: 1 3 5 15 37 47 111 141 185 235 555 705 1739 5217 8695 26085 388931 1166793 1944655 5833965 14390447 18279757 43171341 54839271 71952235 91398785 215856705 274196355 676351009 2029053027 3381755045 10145265135