Base | Representation |
---|---|
bin | 11000010000001111… |
… | …00110101111110011 |
3 | 1020121110112002111201 |
4 | 30020013212233303 |
5 | 203131401111311 |
6 | 5552023352031 |
7 | 640450431352 |
oct | 141007465763 |
9 | 36543462451 |
10 | 13021113331 |
11 | 5582096196 |
12 | 26348b2617 |
13 | 12c6884ab5 |
14 | 8b74a3999 |
15 | 5132229c1 |
hex | 3081e6bf3 |
13021113331 has 4 divisors (see below), whose sum is σ = 13787061192. Its totient is φ = 12255165472.
The previous prime is 13021113319. The next prime is 13021113337. The reversal of 13021113331 is 13331112031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13331112031 = 491 ⋅27150941.
It is a cyclic number.
It is not a de Polignac number, because 13021113331 - 215 = 13021080563 is a prime.
It is a super-2 number, since 2×130211133312 (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 = 13021113299 and 13021113308.
It is not an unprimeable number, because it can be changed into a prime (13021113337) 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, 382973905 + ... + 382973938.
It is an arithmetic number, because the mean of its divisors is an integer number (3446765298).
Almost surely, 213021113331 is an apocalyptic number.
13021113331 is a deficient number, since it is larger than the sum of its proper divisors (765947861).
13021113331 is an equidigital number, since it uses as much as digits as its factorization.
13021113331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 765947860.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 13021113331 its reverse (13331112031), we get a palindrome (26352225362).
The spelling of 13021113331 in words is "thirteen billion, twenty-one million, one hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.863 sec. • engine limits •