Base | Representation |
---|---|
bin | 11000110101010011… |
… | …11110001011111001 |
3 | 1021102010201110122102 |
4 | 30122221332023321 |
5 | 204301010041441 |
6 | 10042533233145 |
7 | 651245040356 |
oct | 143251761371 |
9 | 37363643572 |
10 | 13332112121 |
11 | 57216a2189 |
12 | 2700a927b5 |
13 | 1346133c53 |
14 | 9068db62d |
15 | 5306a569b |
hex | 31aa7e2f9 |
13332112121 has 4 divisors (see below), whose sum is σ = 13339083252. Its totient is φ = 13325140992.
The previous prime is 13332112103. The next prime is 13332112133. The reversal of 13332112121 is 12121123331.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 8423568400 + 4908543721 = 91780^2 + 70061^2 .
It is a cyclic number.
It is not a de Polignac number, because 13332112121 - 210 = 13332111097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13332112093 and 13332112102.
It is not an unprimeable number, because it can be changed into a prime (13332112141) 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, 3482696 + ... + 3486521.
It is an arithmetic number, because the mean of its divisors is an integer number (3334770813).
Almost surely, 213332112121 is an apocalyptic number.
It is an amenable number.
13332112121 is a deficient number, since it is larger than the sum of its proper divisors (6971131).
13332112121 is an equidigital number, since it uses as much as digits as its factorization.
13332112121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6971130.
The product of its digits is 216, while the sum is 20.
Adding to 13332112121 its reverse (12121123331), we get a palindrome (25453235452).
The spelling of 13332112121 in words is "thirteen billion, three hundred thirty-two million, one hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •