Base | Representation |
---|---|
bin | 100011011001111101000000… |
… | …0111010011000010001111101 |
3 | 1111211200102212222201222002020 |
4 | 1012303322000322120101331 |
5 | 311304433113300423123 |
6 | 3022205024450350353 |
7 | 122412043463463033 |
oct | 10663720072302175 |
9 | 1454612788658066 |
10 | 311430241420413 |
11 | 9025a907348565 |
12 | 2ab1932588b3b9 |
13 | 104a09905597bb |
14 | 56c94386a0553 |
15 | 26010368277e3 |
hex | 11b3e80e9847d |
311430241420413 has 8 divisors (see below), whose sum is σ = 415450783291488. Its totient is φ = 207514930248144.
The previous prime is 311430241420369. The next prime is 311430241420433. The reversal of 311430241420413 is 314024142034113.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 311430241420413 - 212 = 311430241416317 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (311430241420433) 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, 26307667795 + ... + 26307679632.
It is an arithmetic number, because the mean of its divisors is an integer number (51931347911436).
Almost surely, 2311430241420413 is an apocalyptic number.
It is an amenable number.
311430241420413 is a deficient number, since it is larger than the sum of its proper divisors (104020541871075).
311430241420413 is a wasteful number, since it uses less digits than its factorization.
311430241420413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52615349403.
The product of its (nonzero) digits is 27648, while the sum is 33.
Adding to 311430241420413 its reverse (314024142034113), we get a palindrome (625454383454526).
The spelling of 311430241420413 in words is "three hundred eleven trillion, four hundred thirty billion, two hundred forty-one million, four hundred twenty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •