Base | Representation |
---|---|
bin | 10010111011111100110… |
… | …101100001000111110001 |
3 | 11121101221100221120120000 |
4 | 102323330311201013301 |
5 | 132310101413323441 |
6 | 2433452530540213 |
7 | 163005654405246 |
oct | 22737465410761 |
9 | 4541840846500 |
10 | 1301322011121 |
11 | 461984393770 |
12 | 190256137669 |
13 | 95938c6b042 |
14 | 46dacd995cd |
15 | 23cb50122b6 |
hex | 12efcd611f1 |
1301322011121 has 80 divisors (see below), whose sum is σ = 2193893104128. Its totient is φ = 761561222400.
The previous prime is 1301322011117. The next prime is 1301322011131. The reversal of 1301322011121 is 1211102231031.
It is not a de Polignac number, because 1301322011121 - 22 = 1301322011117 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1301322011094 and 1301322011103.
It is not an unprimeable number, because it can be changed into a prime (1301322011131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 12571251 + ... + 12674343.
Almost surely, 21301322011121 is an apocalyptic number.
1301322011121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1301322011121 is a deficient number, since it is larger than the sum of its proper divisors (892571093007).
1301322011121 is a wasteful number, since it uses less digits than its factorization.
1301322011121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103604 (or 103595 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 1301322011121 its reverse (1211102231031), we get a palindrome (2512424242152).
The spelling of 1301322011121 in words is "one trillion, three hundred one billion, three hundred twenty-two million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •