Base | Representation |
---|---|
bin | 11000100111010001… |
… | …01001111000111011 |
3 | 1021002221002022220202 |
4 | 30103220221320323 |
5 | 204030331420311 |
6 | 10023124512415 |
7 | 645314630513 |
oct | 142350517073 |
9 | 37087068822 |
10 | 13214326331 |
11 | 5671162a58 |
12 | 268954b70b |
13 | 1327903b0b |
14 | 8d4dda843 |
15 | 52518ae3b |
hex | 313a29e3b |
13214326331 has 4 divisors (see below), whose sum is σ = 13219795992. Its totient is φ = 13208856672.
The previous prime is 13214326327. The next prime is 13214326343. The reversal of 13214326331 is 13362341231.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13362341231 = 75773 ⋅176347.
It is a cyclic number.
It is not a de Polignac number, because 13214326331 - 22 = 13214326327 is a prime.
It is a super-2 number, since 2×132143263312 (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 = 13214326294 and 13214326303.
It is not an unprimeable number, because it can be changed into a prime (13214325331) 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, 2731205 + ... + 2736038.
It is an arithmetic number, because the mean of its divisors is an integer number (3304948998).
Almost surely, 213214326331 is an apocalyptic number.
13214326331 is a deficient number, since it is larger than the sum of its proper divisors (5469661).
13214326331 is an equidigital number, since it uses as much as digits as its factorization.
13214326331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5469660.
The product of its digits is 7776, while the sum is 29.
Adding to 13214326331 its reverse (13362341231), we get a palindrome (26576667562).
The spelling of 13214326331 in words is "thirteen billion, two hundred fourteen million, three hundred twenty-six thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •