Search a number
-
+
10000313301 = 3111915949463
BaseRepresentation
bin10010101000001000…
…01010101111010101
3221210221100112220010
421110010022233111
5130440040011201
64332153230433
7502550155236
oct112404125725
927727315803
1010000313301
114271a09440
121b31102419
13c34a99c64
146ac20508d
153d7e20bd6
hex25410abd5

10000313301 has 16 divisors (see below), whose sum is σ = 15311485440. Its totient is φ = 5741806320.

The previous prime is 10000313299. The next prime is 10000313317. The reversal of 10000313301 is 10331300001.

It is not a de Polignac number, because 10000313301 - 21 = 10000313299 is a prime.

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

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7974105 + ... + 7975358.

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

Almost surely, 210000313301 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 15949496.

The product of its (nonzero) digits is 27, while the sum is 12.

Adding to 10000313301 its reverse (10331300001), we get a palindrome (20331613302).

The spelling of 10000313301 in words is "ten billion, three hundred thirteen thousand, three hundred one".

Divisors: 1 3 11 19 33 57 209 627 15949463 47848389 175444093 303039797 526332279 909119391 3333437767 10000313301