Search a number
-
+
10715065153 = 133126588251
BaseRepresentation
bin10011111101010101…
…01110101101000001
31000122202021201002221
421332222232231001
5133421024041103
64531125011041
7526346360002
oct117652565501
930582251087
1010715065153
1145a9414051
1220b0553a81
131019ba2a50
147390dd1a9
1542aa591bd
hex27eaaeb41

10715065153 has 8 divisors (see below), whose sum is σ = 11911536896. Its totient is φ = 9571770000.

The previous prime is 10715065111. The next prime is 10715065159. The reversal of 10715065153 is 35156051701.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 10715065153 - 29 = 10715064641 is a prime.

It is a super-2 number, since 2×107150651532 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13293723 + ... + 13294528.

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

Almost surely, 210715065153 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 26588295.

The product of its (nonzero) digits is 15750, while the sum is 34.

The spelling of 10715065153 in words is "ten billion, seven hundred fifteen million, sixty-five thousand, one hundred fifty-three".

Divisors: 1 13 31 403 26588251 345647263 824235781 10715065153