Base | Representation |
---|---|
bin | 11000011111101011… |
… | …00110011001010111 |
3 | 1020221111012020221211 |
4 | 30033311212121113 |
5 | 203413024023111 |
6 | 10012531122251 |
7 | 643612230565 |
oct | 141765463127 |
9 | 36844166854 |
10 | 13150611031 |
11 | 56391a4788 |
12 | 2670143387 |
13 | 1317655a5c |
14 | 8ca772a35 |
15 | 51e7a2521 |
hex | 30fd66657 |
13150611031 has 4 divisors (see below), whose sum is σ = 13722376752. Its totient is φ = 12578845312.
The previous prime is 13150611013. The next prime is 13150611041. The reversal of 13150611031 is 13011605131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13150611031 - 27 = 13150610903 is a prime.
It is a super-2 number, since 2×131506110312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13150610993 and 13150611011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13150611041) 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, 285882826 + ... + 285882871.
It is an arithmetic number, because the mean of its divisors is an integer number (3430594188).
Almost surely, 213150611031 is an apocalyptic number.
13150611031 is a deficient number, since it is larger than the sum of its proper divisors (571765721).
13150611031 is an equidigital number, since it uses as much as digits as its factorization.
13150611031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 571765720.
The product of its (nonzero) digits is 270, while the sum is 22.
The spelling of 13150611031 in words is "thirteen billion, one hundred fifty million, six hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •