Search a number
-
+
10331011131 = 372321389257
BaseRepresentation
bin10011001111100011…
…01011100000111011
3222122222121202000220
421213301223200323
5132124214324011
64425045231123
7514004100660
oct114761534073
928588552026
1010331011131
11442164a631
122003a024a3
13c8845554c
147000c9a67
15406e95506
hex267c6b83b

10331011131 has 16 divisors (see below), whose sum is σ = 16426950144. Its totient is φ = 5646763584.

The previous prime is 10331011123. The next prime is 10331011169. The reversal of 10331011131 is 13111013301.

It is not a de Polignac number, because 10331011131 - 23 = 10331011123 is a prime.

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

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

It is not an unprimeable number, because it can be changed into a prime (10331211131) 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, 10694146 + ... + 10695111.

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

Almost surely, 210331011131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 21389290.

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

Adding to 10331011131 its reverse (13111013301), we get a palindrome (23442024432).

The spelling of 10331011131 in words is "ten billion, three hundred thirty-one million, eleven thousand, one hundred thirty-one".

Divisors: 1 3 7 21 23 69 161 483 21389257 64167771 149724799 449174397 491952911 1475858733 3443670377 10331011131