Search a number
-
+
10000326051 = 321111147339
BaseRepresentation
bin10010101000001000…
…01101110110100011
3221210221101012101100
421110010031312203
5130440040413201
64332153405443
7502550240352
oct112404156643
927727335340
1010000326051
114271a17a81
121b31109883
13c34aa29c1
146ac209999
153d7e24886
hex25410dda3

10000326051 has 6 divisors (see below), whose sum is σ = 14444915420. Its totient is φ = 6666884028.

The previous prime is 10000326047. The next prime is 10000326151. The reversal of 10000326051 is 15062300001.

It is not a de Polignac number, because 10000326051 - 22 = 10000326047 is a prime.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 555573661 + ... + 555573678.

Almost surely, 210000326051 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 180, while the sum is 18.

Adding to 10000326051 its reverse (15062300001), we get a palindrome (25062626052).

The spelling of 10000326051 in words is "ten billion, three hundred twenty-six thousand, fifty-one".

Divisors: 1 3 9 1111147339 3333442017 10000326051