Base | Representation |
---|---|
bin | 1011111011001011000110… |
… | …1111111011110010110110 |
3 | 1201102102100121220210220011 |
4 | 2332302301233323302312 |
5 | 3204303240403222220 |
6 | 43515113512530434 |
7 | 2522153211622042 |
oct | 276626157736266 |
9 | 51372317823804 |
10 | 13111222320310 |
11 | 41a5490211184 |
12 | 15790619b0a1a |
13 | 7414c949307a |
14 | 33482d6a9022 |
15 | 17b0bdc2865a |
hex | becb1bfbcb6 |
13111222320310 has 16 divisors (see below), whose sum is σ = 23625121207536. Its totient is φ = 5238950921248.
The previous prime is 13111222320281. The next prime is 13111222320319. The reversal of 13111222320310 is 1302322211131.
It is a super-2 number, since 2×131112223203102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13111222320319) 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 7 ways as a sum of consecutive naturals, for example, 692240917 + ... + 692259856.
It is an arithmetic number, because the mean of its divisors is an integer number (1476570075471).
Almost surely, 213111222320310 is an apocalyptic number.
13111222320310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13111222320310 is a deficient number, since it is larger than the sum of its proper divisors (10513898887226).
13111222320310 is a wasteful number, since it uses less digits than its factorization.
13111222320310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1384501727.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 13111222320310 its reverse (1302322211131), we get a palindrome (14413544531441).
The spelling of 13111222320310 in words is "thirteen trillion, one hundred eleven billion, two hundred twenty-two million, three hundred twenty thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.244 sec. • engine limits •