Search a number
-
+
10145251533 = 319177986869
BaseRepresentation
bin10010111001011010…
…00100000011001101
3222012001002011202210
421130231010003031
5131234141022113
64354411541033
7506260133544
oct113455040315
928161064683
1010145251533
1143368036aa
121b7175a779
13c58b15c21
146c357315b
153e5a006c3
hex25cb440cd

10145251533 has 8 divisors (see below), whose sum is σ = 14238949600. Its totient is φ = 6407527248.

The previous prime is 10145251513. The next prime is 10145251553. The reversal of 10145251533 is 33515254101.

It is an interprime number because it is at equal distance from previous prime (10145251513) and next prime (10145251553).

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

It is not a de Polignac number, because 10145251533 - 213 = 10145243341 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 210145251533 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 177986891.

The product of its (nonzero) digits is 9000, while the sum is 30.

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

Divisors: 1 3 19 57 177986869 533960607 3381750511 10145251533