Base | Representation |
---|---|
bin | 1011111011001110000011… |
… | …0001011001100000011111 |
3 | 1201102111101121101202002012 |
4 | 2332303200301121200133 |
5 | 3204311344333431221 |
6 | 43515324054021435 |
7 | 2522211601360664 |
oct | 276634061314037 |
9 | 51374347352065 |
10 | 13112011233311 |
11 | 41a585556a1a1 |
12 | 157924204787b |
13 | 7415c3a636b3 |
14 | 3348a6389a6b |
15 | 17b11811065b |
hex | bece0c5981f |
13112011233311 has 4 divisors (see below), whose sum is σ = 13119630067824. Its totient is φ = 13104392398800.
The previous prime is 13112011233289. The next prime is 13112011233323. The reversal of 13112011233311 is 11333211021131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13112011233311 - 26 = 13112011233247 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13112011233341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3809414675 + ... + 3809418116.
It is an arithmetic number, because the mean of its divisors is an integer number (3279907516956).
Almost surely, 213112011233311 is an apocalyptic number.
13112011233311 is a deficient number, since it is larger than the sum of its proper divisors (7618834513).
13112011233311 is an equidigital number, since it uses as much as digits as its factorization.
13112011233311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7618834512.
The product of its (nonzero) digits is 324, while the sum is 23.
Adding to 13112011233311 its reverse (11333211021131), we get a palindrome (24445222254442).
The spelling of 13112011233311 in words is "thirteen trillion, one hundred twelve billion, eleven million, two hundred thirty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •