Base | Representation |
---|---|
bin | 10011000101000101011… |
… | …100000001101010000001 |
3 | 11122100020220102000221102 |
4 | 103011011130001222001 |
5 | 132440143240000001 |
6 | 2442154054104145 |
7 | 163504011055103 |
oct | 23050534015201 |
9 | 4570226360842 |
10 | 1311130000001 |
11 | 4660577819a8 |
12 | 19213294b055 |
13 | 9683cc3a563 |
14 | 4765d819573 |
15 | 2418b0e2e6b |
hex | 13145701a81 |
1311130000001 has 4 divisors (see below), whose sum is σ = 1311158630100. Its totient is φ = 1311101369904.
The previous prime is 1311129999983. The next prime is 1311130000021. The reversal of 1311130000001 is 1000000311131.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1102340405776 + 208789594225 = 1049924^2 + 456935^2 .
It is a cyclic number.
It is not a de Polignac number, because 1311130000001 - 210 = 1311129998977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1311130000021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14246246 + ... + 14337983.
It is an arithmetic number, because the mean of its divisors is an integer number (327789657525).
Almost surely, 21311130000001 is an apocalyptic number.
It is an amenable number.
1311130000001 is a deficient number, since it is larger than the sum of its proper divisors (28630099).
1311130000001 is an equidigital number, since it uses as much as digits as its factorization.
1311130000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28630098.
The product of its (nonzero) digits is 9, while the sum is 11.
Adding to 1311130000001 its reverse (1000000311131), we get a palindrome (2311130311132).
The spelling of 1311130000001 in words is "one trillion, three hundred eleven billion, one hundred thirty million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •