Base | Representation |
---|---|
bin | 100011011010000010000100… |
… | …0110000010010111011001001 |
3 | 1111211201110221110122222221021 |
4 | 1012310010020300102323021 |
5 | 311310122343231204001 |
6 | 3022214023154512441 |
7 | 122412610022421052 |
oct | 10664041060227311 |
9 | 1454643843588837 |
10 | 311441110413001 |
11 | 90264484636568 |
12 | 2ab1b459895721 |
13 | 104a1a032a4c6a |
14 | 56c9b89dcb729 |
15 | 2601470b39ba1 |
hex | 11b4108c12ec9 |
311441110413001 has 16 divisors (see below), whose sum is σ = 313224658080768. Its totient is φ = 309659192438400.
The previous prime is 311441110412921. The next prime is 311441110413011. The reversal of 311441110413001 is 100314011144113.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-311441110413001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (311441110413011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3599058931 + ... + 3599145463.
It is an arithmetic number, because the mean of its divisors is an integer number (19576541130048).
Almost surely, 2311441110413001 is an apocalyptic number.
It is an amenable number.
311441110413001 is a deficient number, since it is larger than the sum of its proper divisors (1783547667767).
311441110413001 is a wasteful number, since it uses less digits than its factorization.
311441110413001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95712.
The product of its (nonzero) digits is 576, while the sum is 25.
Adding to 311441110413001 its reverse (100314011144113), we get a palindrome (411755121557114).
The spelling of 311441110413001 in words is "three hundred eleven trillion, four hundred forty-one billion, one hundred ten million, four hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •