Search a number
-
+
10005060513 = 372372728493
BaseRepresentation
bin10010101000101100…
…10001101110100001
3221211021021201211210
421110112101232201
5130442243414023
64332443100333
7502635416430
oct112426215641
927737251753
1010005060513
114274661058
121b328116a9
13c35a6c966
146acabd117
153d855c593
hex254591ba1

10005060513 has 32 divisors (see below), whose sum is σ = 15931109376. Its totient is φ = 5460890688.

The previous prime is 10005060511. The next prime is 10005060521. The reversal of 10005060513 is 31506050001.

It is a happy number.

It is not a de Polignac number, because 10005060513 - 21 = 10005060511 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (21).

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

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

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

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

Almost surely, 210005060513 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 29253.

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

The spelling of 10005060513 in words is "ten billion, five million, sixty thousand, five hundred thirteen".

Divisors: 1 3 7 21 23 69 161 483 727 2181 5089 15267 16721 28493 50163 85479 117047 199451 351141 598353 655339 1966017 4587373 13762119 20714411 62143233 145000877 435002631 476431453 1429294359 3335020171 10005060513