Base | Representation |
---|---|
bin | 1001001101101110000111… |
… | …0110010110001000101011 |
3 | 1022212112201020202021000201 |
4 | 2103123201312112020223 |
5 | 2311442421413112021 |
6 | 33314133131213031 |
7 | 2063651414065615 |
oct | 223334166261053 |
9 | 38775636667021 |
10 | 10131322004011 |
11 | 325674016a34a |
12 | 11776272a7177 |
13 | 5864c1ba0640 |
14 | 270504005db5 |
15 | 128813d91591 |
hex | 936e1d9622b |
10131322004011 has 16 divisors (see below), whose sum is σ = 11590087902624. Its totient is φ = 8773201857024.
The previous prime is 10131322003973. The next prime is 10131322004099. The reversal of 10131322004011 is 11040022313101.
10131322004011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10131322004011 - 27 = 10131322003883 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10131322004011.
It is not an unprimeable number, because it can be changed into a prime (10131322004711) 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, 74595160 + ... + 74730853.
It is an arithmetic number, because the mean of its divisors is an integer number (724380493914).
Almost surely, 210131322004011 is an apocalyptic number.
10131322004011 is a deficient number, since it is larger than the sum of its proper divisors (1458765898613).
10131322004011 is a wasteful number, since it uses less digits than its factorization.
10131322004011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 149326350.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 10131322004011 its reverse (11040022313101), we get a palindrome (21171344317112).
The spelling of 10131322004011 in words is "ten trillion, one hundred thirty-one billion, three hundred twenty-two million, four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •