Base | Representation |
---|---|
bin | 10011000101000000011… |
… | …000011001100100110001 |
3 | 11122100000222202212212212 |
4 | 103011000120121210301 |
5 | 132440010030211223 |
6 | 2442141423501505 |
7 | 163501631005604 |
oct | 23050030314461 |
9 | 4570028685785 |
10 | 1311045163313 |
11 | 4660138a7936 |
12 | 19210a457895 |
13 | 968284a5832 |
14 | 4765245433b |
15 | 24183936278 |
hex | 13140619931 |
1311045163313 has 8 divisors (see below), whose sum is σ = 1312135306560. Its totient is φ = 1309955469840.
The previous prime is 1311045163261. The next prime is 1311045163333. The reversal of 1311045163313 is 3133615401131.
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 1311045163313 - 210 = 1311045162289 is a prime.
It is a super-3 number, since 3×13110451633133 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
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 1311045163313.
It is not an unprimeable number, because it can be changed into a prime (1311045163333) 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, 5850428 + ... + 6070386.
It is an arithmetic number, because the mean of its divisors is an integer number (164016913320).
Almost surely, 21311045163313 is an apocalyptic number.
It is an amenable number.
1311045163313 is a deficient number, since it is larger than the sum of its proper divisors (1090143247).
1311045163313 is a wasteful number, since it uses less digits than its factorization.
1311045163313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 224887.
The product of its (nonzero) digits is 9720, while the sum is 32.
The spelling of 1311045163313 in words is "one trillion, three hundred eleven billion, forty-five million, one hundred sixty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •