Base | Representation |
---|---|
bin | 10000011101011100110… |
… | …010110011010010101101 |
3 | 11000010122121201012201110 |
4 | 100131130302303102231 |
5 | 122013030101020023 |
6 | 2223345130302233 |
7 | 144502351505556 |
oct | 20353462632255 |
9 | 4003577635643 |
10 | 1131133220013 |
11 | 3a6790239a95 |
12 | 16327a287979 |
13 | 82885b82854 |
14 | 3ca6621b32d |
15 | 1e653d23a93 |
hex | 1075ccb34ad |
1131133220013 has 8 divisors (see below), whose sum is σ = 1529419565376. Its totient is φ = 743467844000.
The previous prime is 1131133219999. The next prime is 1131133220039. The reversal of 1131133220013 is 3100223311311.
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 not a de Polignac number, because 1131133220013 - 210 = 1131133218989 is a prime.
It is a super-2 number, since 2×11311332200132 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1131133220053) 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, 2655242088 + ... + 2655242513.
It is an arithmetic number, because the mean of its divisors is an integer number (191177445672).
Almost surely, 21131133220013 is an apocalyptic number.
It is an amenable number.
1131133220013 is a deficient number, since it is larger than the sum of its proper divisors (398286345363).
1131133220013 is an equidigital number, since it uses as much as digits as its factorization.
1131133220013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5310484675.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 1131133220013 its reverse (3100223311311), we get a palindrome (4231356531324).
The spelling of 1131133220013 in words is "one trillion, one hundred thirty-one billion, one hundred thirty-three million, two hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •