Search a number
-
+
10000011013131 = 310143176573867
BaseRepresentation
bin1001000110000100111100…
…0110101010110000001011
31022101222202221221210000010
42101201033012222300023
52302320010304410011
633133535221043003
72051322411063456
oct221411706526013
938358687853003
1010000011013131
113205a87576387
12115609b556463
13576cc6513279
1426800879849d
151251cadbb1a6
hex9184f1aac0b

10000011013131 has 16 divisors (see below), whose sum is σ = 13496603678208. Its totient is φ = 6585352476000.

The previous prime is 10000011013123. The next prime is 10000011013141. The reversal of 10000011013131 is 13131011000001.

It is not a de Polignac number, because 10000011013131 - 23 = 10000011013123 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 210000011013131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 76574402.

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

Adding to 10000011013131 its reverse (13131011000001), we get a palindrome (23131022013132).

The spelling of 10000011013131 in words is "ten trillion, eleven million, thirteen thousand, one hundred thirty-one".

Divisors: 1 3 101 303 431 1293 43531 130593 76573867 229721601 7733960567 23201881701 33003336677 99010010031 3333337004377 10000011013131