Search a number
-
+
10000060057 = 132443133571
BaseRepresentation
bin10010101000000110…
…01100111010011001
3221210220212200111201
421110003030322121
5130440003410212
64332143554201
7502545052021
oct112403147231
927726780451
1010000060057
114271856149
121b30bbb961
13c34a0b900
146ac17aa81
153d7dc0b57
hex2540cce99

10000060057 has 12 divisors (see below), whose sum is σ = 10852992144. Its totient is φ = 9209918640.

The previous prime is 10000060039. The next prime is 10000060061. The reversal of 10000060057 is 75006000001.

It is not a de Polignac number, because 10000060057 - 27 = 10000059929 is a prime.

It is a super-2 number, since 2×100000600572 (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 (10000060027) by changing a digit.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8082 + ... + 141652.

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

Almost surely, 210000060057 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 134040 (or 134027 counting only the distinct ones).

The product of its (nonzero) digits is 210, while the sum is 19.

Adding to 10000060057 its reverse (75006000001), we get a palindrome (85006060058).

The spelling of 10000060057 in words is "ten billion, sixty thousand, fifty-seven".

Divisors: 1 13 169 443 5759 74867 133571 1736423 22573499 59171953 769235389 10000060057