Base | Representation |
---|---|
bin | 10011000101100010101… |
… | …010110000110110111101 |
3 | 11122101112002012001212102 |
4 | 103011202222300312331 |
5 | 132442144310340441 |
6 | 2442314453114445 |
7 | 163522114320254 |
oct | 23054252606675 |
9 | 4571462161772 |
10 | 1311620402621 |
11 | 466289583721 |
12 | 19224b028a25 |
13 | 968ba712119 |
14 | 476a89d379b |
15 | 241b91b269b |
hex | 13162ab0dbd |
1311620402621 has 4 divisors (see below), whose sum is σ = 1368647376672. Its totient is φ = 1254593428572.
The previous prime is 1311620402597. The next prime is 1311620402633. The reversal of 1311620402621 is 1262040261131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1311620402621 - 234 = 1294440533437 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1311620402641) 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, 28513486991 + ... + 28513487036.
It is an arithmetic number, because the mean of its divisors is an integer number (342161844168).
Almost surely, 21311620402621 is an apocalyptic number.
It is an amenable number.
1311620402621 is a deficient number, since it is larger than the sum of its proper divisors (57026974051).
1311620402621 is an equidigital number, since it uses as much as digits as its factorization.
1311620402621 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57026974050.
The product of its (nonzero) digits is 3456, while the sum is 29.
Adding to 1311620402621 its reverse (1262040261131), we get a palindrome (2573660663752).
The spelling of 1311620402621 in words is "one trillion, three hundred eleven billion, six hundred twenty million, four hundred two thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •