Base | Representation |
---|---|
bin | 1100000110110011011010… |
… | …1111101110111111011011 |
3 | 1202010112002000111221022120 |
4 | 3001230312233232333123 |
5 | 3221041433131230321 |
6 | 44150555452152323 |
7 | 2542455352202145 |
oct | 301546657567733 |
9 | 52115060457276 |
10 | 13311022133211 |
11 | 4272199a818a0 |
12 | 15ab9224686a3 |
13 | 7572bb190a2a |
14 | 340384d59c95 |
15 | 1813b4807ec6 |
hex | c1b36beefdb |
13311022133211 has 16 divisors (see below), whose sum is σ = 19361848359168. Its totient is φ = 8067135466400.
The previous prime is 13311022133107. The next prime is 13311022133237. The reversal of 13311022133211 is 11233122011331.
It is a cyclic number.
It is not a de Polignac number, because 13311022133211 - 213 = 13311022125019 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13311022133251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1960320 + ... + 5519501.
It is an arithmetic number, because the mean of its divisors is an integer number (1210115522448).
Almost surely, 213311022133211 is an apocalyptic number.
13311022133211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13311022133211 is a deficient number, since it is larger than the sum of its proper divisors (6050826225957).
13311022133211 is a wasteful number, since it uses less digits than its factorization.
13311022133211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7533762.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 13311022133211 its reverse (11233122011331), we get a palindrome (24544144144542).
The spelling of 13311022133211 in words is "thirteen trillion, three hundred eleven billion, twenty-two million, one hundred thirty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.189 sec. • engine limits •