Base | Representation |
---|---|
bin | 10011000100010100110… |
… | …011010001101001010101 |
3 | 11122021011000222111202202 |
4 | 103010110303101221111 |
5 | 132432010341324341 |
6 | 2441541104414245 |
7 | 163444542220055 |
oct | 23042463215125 |
9 | 4567130874682 |
10 | 1310314011221 |
11 | 465779110506 |
12 | 191b45617385 |
13 | 9673cb79c67 |
14 | 475c32cb565 |
15 | 2413e65d79b |
hex | 13114cd1a55 |
1310314011221 has 8 divisors (see below), whose sum is σ = 1332210563424. Its totient is φ = 1288430878320.
The previous prime is 1310314011199. The next prime is 1310314011239. The reversal of 1310314011221 is 1221104130131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1310314011221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1310314011193 and 1310314011202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1310314011271) 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, 3157811 + ... + 3548576.
It is an arithmetic number, because the mean of its divisors is an integer number (166526320428).
Almost surely, 21310314011221 is an apocalyptic number.
It is an amenable number.
1310314011221 is a deficient number, since it is larger than the sum of its proper divisors (21896552203).
1310314011221 is an equidigital number, since it uses as much as digits as its factorization.
1310314011221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6709651.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 1310314011221 its reverse (1221104130131), we get a palindrome (2531418141352).
The spelling of 1310314011221 in words is "one trillion, three hundred ten billion, three hundred fourteen million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •