Base | Representation |
---|---|
bin | 11000110011110111… |
… | …10110010101010011 |
3 | 1021101021222012012101 |
4 | 30121323312111103 |
5 | 204234411140311 |
6 | 10041422141231 |
7 | 651040212301 |
oct | 143173662523 |
9 | 37337865171 |
10 | 13320021331 |
11 | 57158941a1 |
12 | 26b8a21817 |
13 | 134378c836 |
14 | 905071271 |
15 | 52e5b7ec1 |
hex | 319ef6553 |
13320021331 has 4 divisors (see below), whose sum is σ = 13320255064. Its totient is φ = 13319787600.
The previous prime is 13320021301. The next prime is 13320021353. The reversal of 13320021331 is 13312002331.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13312002331 = 9551 ⋅1393781.
It is a cyclic number.
It is not a de Polignac number, because 13320021331 - 213 = 13320013139 is a prime.
It is a super-2 number, since 2×133200213312 (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 = 13320021299 and 13320021308.
It is not an unprimeable number, because it can be changed into a prime (13320021301) 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, 30871 + ... + 166111.
It is an arithmetic number, because the mean of its divisors is an integer number (3330063766).
Almost surely, 213320021331 is an apocalyptic number.
13320021331 is a deficient number, since it is larger than the sum of its proper divisors (233733).
13320021331 is an equidigital number, since it uses as much as digits as its factorization.
13320021331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 233732.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 13320021331 its reverse (13312002331), we get a palindrome (26632023662).
The spelling of 13320021331 in words is "thirteen billion, three hundred twenty million, twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •