Base | Representation |
---|---|
bin | 10011011000110100011… |
… | …101111001001001011001 |
3 | 11201100221200100022122022 |
4 | 103120310131321021121 |
5 | 133312042422110431 |
6 | 2500020455504225 |
7 | 165154064051645 |
oct | 23306435711131 |
9 | 4640850308568 |
10 | 1332320113241 |
11 | 474040a74687 |
12 | 196267388075 |
13 | 988390574c0 |
14 | 486adbb9c25 |
15 | 249cb59507b |
hex | 13634779259 |
1332320113241 has 16 divisors (see below), whose sum is σ = 1435907995200. Its totient is φ = 1228890007488.
The previous prime is 1332320113219. The next prime is 1332320113261. The reversal of 1332320113241 is 1423110232331.
It is a happy number.
It is not a de Polignac number, because 1332320113241 - 210 = 1332320112217 is a prime.
It is a super-2 number, since 2×13323201132412 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1332320113241.
It is not an unprimeable number, because it can be changed into a prime (1332320113261) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 182331110 + ... + 182338416.
It is an arithmetic number, because the mean of its divisors is an integer number (89744249700).
Almost surely, 21332320113241 is an apocalyptic number.
It is an amenable number.
1332320113241 is a deficient number, since it is larger than the sum of its proper divisors (103587881959).
1332320113241 is a wasteful number, since it uses less digits than its factorization.
1332320113241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16168.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 1332320113241 its reverse (1423110232331), we get a palindrome (2755430345572).
The spelling of 1332320113241 in words is "one trillion, three hundred thirty-two billion, three hundred twenty million, one hundred thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •