Base | Representation |
---|---|
bin | 10011010111110011000… |
… | …001010011100010010001 |
3 | 11201021010011020110210102 |
4 | 103113303001103202101 |
5 | 133302320324200423 |
6 | 2455315513342145 |
7 | 165114632102333 |
oct | 23276301234221 |
9 | 4637104213712 |
10 | 1331222100113 |
11 | 473628197114 |
12 | 195bbb707955 |
13 | 986c2720ca9 |
14 | 48608037453 |
15 | 24964ea2c28 |
hex | 135f3053891 |
1331222100113 has 16 divisors (see below), whose sum is σ = 1364524953792. Its totient is φ = 1298027808000.
The previous prime is 1331222100077. The next prime is 1331222100119. The reversal of 1331222100113 is 3110012221331.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1331222100113 - 216 = 1331222034577 is a prime.
It is a super-2 number, since 2×13312221001132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1331222100119) 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 15 ways as a sum of consecutive naturals, for example, 61961333 + ... + 61982813.
It is an arithmetic number, because the mean of its divisors is an integer number (85282809612).
Almost surely, 21331222100113 is an apocalyptic number.
It is an amenable number.
1331222100113 is a deficient number, since it is larger than the sum of its proper divisors (33302853679).
1331222100113 is a wasteful number, since it uses less digits than its factorization.
1331222100113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23936.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1331222100113 its reverse (3110012221331), we get a palindrome (4441234321444).
The spelling of 1331222100113 in words is "one trillion, three hundred thirty-one billion, two hundred twenty-two million, one hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •