Base | Representation |
---|---|
bin | 11000011101100111… |
… | …01001011110001001 |
3 | 1020220021122220000211 |
4 | 30032303221132021 |
5 | 203344112301441 |
6 | 10011112401121 |
7 | 643312252603 |
oct | 141663513611 |
9 | 36807586024 |
10 | 13133322121 |
11 | 562a466327 |
12 | 26663a61a1 |
13 | 1313bb162a |
14 | 8c8352173 |
15 | 51ced9a81 |
hex | 30ece9789 |
13133322121 has 4 divisors (see below), whose sum is σ = 13133676672. Its totient is φ = 13132967572.
The previous prime is 13133322119. The next prime is 13133322127. The reversal of 13133322121 is 12122333131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 12122333131 = 107 ⋅113292833.
It is a cyclic number.
It is not a de Polignac number, because 13133322121 - 21 = 13133322119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13133322092 and 13133322101.
It is not an unprimeable number, because it can be changed into a prime (13133322127) 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, 114241 + ... + 198286.
It is an arithmetic number, because the mean of its divisors is an integer number (3283419168).
Almost surely, 213133322121 is an apocalyptic number.
It is an amenable number.
13133322121 is a deficient number, since it is larger than the sum of its proper divisors (354551).
13133322121 is an equidigital number, since it uses as much as digits as its factorization.
13133322121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 354550.
The product of its digits is 648, while the sum is 22.
Adding to 13133322121 its reverse (12122333131), we get a palindrome (25255655252).
The spelling of 13133322121 in words is "thirteen billion, one hundred thirty-three million, three hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •