Base | Representation |
---|---|
bin | 1011111011001110011101… |
… | …0100111001000111101101 |
3 | 1201102111200021022200120111 |
4 | 2332303213110321013231 |
5 | 3204312111011414013 |
6 | 43515343023020021 |
7 | 2522214405156613 |
oct | 276634724710755 |
9 | 51374607280514 |
10 | 13112121201133 |
11 | 41a5901649699 |
12 | 1579272a3a611 |
13 | 741610787206 |
14 | 3348b6c136b3 |
15 | 17b122ad373d |
hex | bece75391ed |
13112121201133 has 2 divisors, whose sum is σ = 13112121201134. Its totient is φ = 13112121201132.
The previous prime is 13112121201131. The next prime is 13112121201139. The reversal of 13112121201133 is 33110212121131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9354777039364 + 3757344161769 = 3058558^2 + 1938387^2 .
It is a cyclic number.
It is not a de Polignac number, because 13112121201133 - 21 = 13112121201131 is a prime.
Together with 13112121201131, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13112121201131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6556060600566 + 6556060600567.
It is an arithmetic number, because the mean of its divisors is an integer number (6556060600567).
Almost surely, 213112121201133 is an apocalyptic number.
It is an amenable number.
13112121201133 is a deficient number, since it is larger than the sum of its proper divisors (1).
13112121201133 is an equidigital number, since it uses as much as digits as its factorization.
13112121201133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 13112121201133 its reverse (33110212121131), we get a palindrome (46222333322264).
The spelling of 13112121201133 in words is "thirteen trillion, one hundred twelve billion, one hundred twenty-one million, two hundred one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •