Base | Representation |
---|---|
bin | 10011000110000001001… |
… | …110010000001001110001 |
3 | 11122102211210202211220020 |
4 | 103012001032100021301 |
5 | 132444222023203241 |
6 | 2442441404234053 |
7 | 163540610444322 |
oct | 23060116201161 |
9 | 4572753684806 |
10 | 1312133022321 |
11 | 46652197a470 |
12 | 19237283b929 |
13 | 9696c9952a4 |
14 | 47716b12449 |
15 | 241e91beb66 |
hex | 13181390271 |
1312133022321 has 16 divisors (see below), whose sum is σ = 1910864971008. Its totient is φ = 794270531600.
The previous prime is 1312133022289. The next prime is 1312133022329. The reversal of 1312133022321 is 1232203312131.
It is a cyclic number.
It is not a de Polignac number, because 1312133022321 - 25 = 1312133022289 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1312133022291 and 1312133022300.
It is not an unprimeable number, because it can be changed into a prime (1312133022329) 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, 24012375 + ... + 24066956.
It is an arithmetic number, because the mean of its divisors is an integer number (119429060688).
Almost surely, 21312133022321 is an apocalyptic number.
1312133022321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1312133022321 is a deficient number, since it is larger than the sum of its proper divisors (598731948687).
1312133022321 is a wasteful number, since it uses less digits than its factorization.
1312133022321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48080172.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 1312133022321 its reverse (1232203312131), we get a palindrome (2544336334452).
The spelling of 1312133022321 in words is "one trillion, three hundred twelve billion, one hundred thirty-three million, twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •