Base | Representation |
---|---|
bin | 1010001100101000011001… |
… | …1011111001000110111111 |
3 | 1110200212102221001022011222 |
4 | 2203022012123321012333 |
5 | 2432144410221220221 |
6 | 35502435445303555 |
7 | 2235022534246553 |
oct | 243120633710677 |
9 | 43625387038158 |
10 | 11212120101311 |
11 | 3633040552668 |
12 | 1310b98404bbb |
13 | 6343b5738abc |
14 | 2aa9531b9863 |
15 | 1469bdbc49ab |
hex | a32866f91bf |
11212120101311 has 4 divisors (see below), whose sum is σ = 11216039055624. Its totient is φ = 11208201147000.
The previous prime is 11212120101289. The next prime is 11212120101379. The reversal of 11212120101311 is 11310102121211.
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 11212120101311 - 210 = 11212120100287 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11212120101311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11212120151311) 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, 1959472865 + ... + 1959478586.
It is an arithmetic number, because the mean of its divisors is an integer number (2804009763906).
Almost surely, 211212120101311 is an apocalyptic number.
11212120101311 is a deficient number, since it is larger than the sum of its proper divisors (3918954313).
11212120101311 is an equidigital number, since it uses as much as digits as its factorization.
11212120101311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3918954312.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 11212120101311 its reverse (11310102121211), we get a palindrome (22522222222522).
The spelling of 11212120101311 in words is "eleven trillion, two hundred twelve billion, one hundred twenty million, one hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •