Base | Representation |
---|---|
bin | 11000011010111101… |
… | …11101010100111101 |
3 | 1020211201212222002222 |
4 | 30031132331110331 |
5 | 203322421334323 |
6 | 10005000455125 |
7 | 642622456121 |
oct | 141536752475 |
9 | 36751788088 |
10 | 13111121213 |
11 | 5618982473 |
12 | 265aa7a4a5 |
13 | 130c40a4b8 |
14 | 8c5413581 |
15 | 51b0a19c8 |
hex | 30d7bd53d |
13111121213 has 4 divisors (see below), whose sum is σ = 13111975740. Its totient is φ = 13110266688.
The previous prime is 13111121147. The next prime is 13111121239. The reversal of 13111121213 is 31212111131.
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 7988426884 + 5122694329 = 89378^2 + 71573^2 .
It is a cyclic number.
It is not a de Polignac number, because 13111121213 - 210 = 13111120189 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13111121191 and 13111121200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13111126213) 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, 403820 + ... + 435077.
It is an arithmetic number, because the mean of its divisors is an integer number (3277993935).
Almost surely, 213111121213 is an apocalyptic number.
It is an amenable number.
13111121213 is a deficient number, since it is larger than the sum of its proper divisors (854527).
13111121213 is an equidigital number, since it uses as much as digits as its factorization.
13111121213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 854526.
The product of its digits is 36, while the sum is 17.
Adding to 13111121213 its reverse (31212111131), we get a palindrome (44323232344).
The spelling of 13111121213 in words is "thirteen billion, one hundred eleven million, one hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •