Base | Representation |
---|---|
bin | 1100000110110100001010… |
… | …0010100010100011110011 |
3 | 1202010112120210211122220121 |
4 | 3001231002202202203303 |
5 | 3221042334310013021 |
6 | 44151031241151111 |
7 | 2542463304066202 |
oct | 301550242424363 |
9 | 52115523748817 |
10 | 13311220001011 |
11 | 42722907388a9 |
12 | 15ab97878b497 |
13 | 75732017c67a |
14 | 3403a3345239 |
15 | 1813c6d90741 |
hex | c1b428a28f3 |
13311220001011 has 32 divisors (see below), whose sum is σ = 14651554406400. Its totient is φ = 12045519383040.
The previous prime is 13311220000997. The next prime is 13311220001033. The reversal of 13311220001011 is 11010002211331.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 13311220001011 - 29 = 13311220000499 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13311220001711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 151507551 + ... + 151595383.
It is an arithmetic number, because the mean of its divisors is an integer number (457861075200).
Almost surely, 213311220001011 is an apocalyptic number.
13311220001011 is a deficient number, since it is larger than the sum of its proper divisors (1340334405389).
13311220001011 is a wasteful number, since it uses less digits than its factorization.
13311220001011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91219.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 13311220001011 its reverse (11010002211331), we get a palindrome (24321222212342).
The spelling of 13311220001011 in words is "thirteen trillion, three hundred eleven billion, two hundred twenty million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •