Search a number
-
+
10152311135 = 519743143831
BaseRepresentation
bin10010111010001111…
…11111100101011111
3222012112100211201112
421131013333211133
5131242442424020
64355223132235
7506404135511
oct113507774537
928175324645
1010152311135
11433a79568a
121b73ba407b
13c5a4182c5
146c448dbb1
153e64472c5
hex25d1ff95f

10152311135 has 16 divisors (see below), whose sum is σ = 12841320960. Its totient is φ = 7683973920.

The previous prime is 10152311131. The next prime is 10152311149. The reversal of 10152311135 is 53111325101.

It is not a de Polignac number, because 10152311135 - 22 = 10152311131 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10152311131) 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 15 ways as a sum of consecutive naturals, for example, 1331 + ... + 142500.

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

Almost surely, 210152311135 is an apocalyptic number.

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

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

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

The sum of its prime factors is 144598.

The product of its (nonzero) digits is 450, while the sum is 23.

Adding to 10152311135 its reverse (53111325101), we get a palindrome (63263636236).

The spelling of 10152311135 in words is "ten billion, one hundred fifty-two million, three hundred eleven thousand, one hundred thirty-five".

Divisors: 1 5 19 95 743 3715 14117 70585 143831 719155 2732789 13663945 106866433 534332165 2030462227 10152311135