Base | Representation |
---|---|
bin | 11000101001010001… |
… | …01001010001100111 |
3 | 1021011002122120110221 |
4 | 30110220221101213 |
5 | 204044130213111 |
6 | 10024524225211 |
7 | 645610334401 |
oct | 142450512147 |
9 | 37132576427 |
10 | 13231101031 |
11 | 567a680045 |
12 | 269309b207 |
13 | 132b228185 |
14 | 8d7325b71 |
15 | 5268a1371 |
hex | 314a29467 |
13231101031 has 4 divisors (see below), whose sum is σ = 13232224512. Its totient is φ = 13229977552.
The previous prime is 13231101011. The next prime is 13231101061. The reversal of 13231101031 is 13010113231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13010113231 = 23 ⋅565657097.
It is a cyclic number.
It is not a de Polignac number, because 13231101031 - 217 = 13230969959 is a prime.
It is a super-2 number, since 2×132311010312 (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 = 13231100996 and 13231101014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13231101011) 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, 543886 + ... + 567691.
It is an arithmetic number, because the mean of its divisors is an integer number (3308056128).
Almost surely, 213231101031 is an apocalyptic number.
13231101031 is a deficient number, since it is larger than the sum of its proper divisors (1123481).
13231101031 is a wasteful number, since it uses less digits than its factorization.
13231101031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1123480.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 13231101031 its reverse (13010113231), we get a palindrome (26241214262).
The spelling of 13231101031 in words is "thirteen billion, two hundred thirty-one million, one hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •