Base | Representation |
---|---|
bin | 1011111011110100000000… |
… | …0101101001001000100111 |
3 | 1201110110200200221111002102 |
4 | 2332331000011221020213 |
5 | 3204443231234412221 |
6 | 43524131113202315 |
7 | 2523022233164561 |
oct | 276750005511047 |
9 | 51413620844072 |
10 | 13122200310311 |
11 | 41aa103a86594 |
12 | 157b20640039b |
13 | 742558982441 |
14 | 33519168a331 |
15 | 17b5128bb30b |
hex | bef40169227 |
13122200310311 has 8 divisors (see below), whose sum is σ = 13428249433104. Its totient is φ = 12816191263680.
The previous prime is 13122200310287. The next prime is 13122200310337. The reversal of 13122200310311 is 11301300222131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13122200310311 is a prime.
It is a super-2 number, since 2×131222003103112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13122200310341) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9356036 + ... + 10666761.
It is an arithmetic number, because the mean of its divisors is an integer number (1678531179138).
Almost surely, 213122200310311 is an apocalyptic number.
13122200310311 is a deficient number, since it is larger than the sum of its proper divisors (306049122793).
13122200310311 is a wasteful number, since it uses less digits than its factorization.
13122200310311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20038081.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13122200310311 its reverse (11301300222131), we get a palindrome (24423500532442).
The spelling of 13122200310311 in words is "thirteen trillion, one hundred twenty-two billion, two hundred million, three hundred ten thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •