Base | Representation |
---|---|
bin | 10010110111101111… |
… | …11011010010011101 |
3 | 222011001212111001122 |
4 | 21123313323102131 |
5 | 131222104301023 |
6 | 4353153220325 |
7 | 506030546651 |
oct | 113367732235 |
9 | 28131774048 |
10 | 10131322013 |
11 | 432995a1aa |
12 | 1b68b616a5 |
13 | c55c798c7 |
14 | 6c1788a61 |
15 | 3e469d2c8 |
hex | 25bdfb49d |
10131322013 has 4 divisors (see below), whose sum is σ = 10132513728. Its totient is φ = 10130130300.
The previous prime is 10131322001. The next prime is 10131322093. The reversal of 10131322013 is 31022313101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31022313101 = 13 ⋅2386331777.
It is a cyclic number.
It is not a de Polignac number, because 10131322013 - 210 = 10131320989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10131321982 and 10131322000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10131322093) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 583013 + ... + 600138.
It is an arithmetic number, because the mean of its divisors is an integer number (2533128432).
Almost surely, 210131322013 is an apocalyptic number.
It is an amenable number.
10131322013 is a deficient number, since it is larger than the sum of its proper divisors (1191715).
10131322013 is an equidigital number, since it uses as much as digits as its factorization.
10131322013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1191714.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10131322013 its reverse (31022313101), we get a palindrome (41153635114).
The spelling of 10131322013 in words is "ten billion, one hundred thirty-one million, three hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •