Search a number
-
+
10131243404 = 223869965449
BaseRepresentation
bin10010110111101111…
…01000000110001100
3222011001201111020012
421123313220012030
5131222044242104
64353151412352
7506030101532
oct113367500614
928131644205
1010131243404
114329906137
121b68b240b8
13c55c4cba9
146c1768152
153e4684d6e
hex25bde818c

10131243404 has 12 divisors (see below), whose sum is σ = 17730405000. Its totient is φ = 5065413408.

The previous prime is 10131243391. The next prime is 10131243433. The reversal of 10131243404 is 40434213101.

10131243404 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a super-2 number, since 2×101312434042 (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 10131243404.

It is an unprimeable number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 122072 + ... + 187520.

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

Almost surely, 210131243404 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 1152, while the sum is 23.

Adding to 10131243404 its reverse (40434213101), we get a palindrome (50565456505).

The spelling of 10131243404 in words is "ten billion, one hundred thirty-one million, two hundred forty-three thousand, four hundred four".

Divisors: 1 2 4 38699 65449 77398 130898 154796 261796 2532810851 5065621702 10131243404