Base | Representation |
---|---|
bin | 101001010010010011101… |
… | …1010110001000111000101 |
3 | 202002110101122020010211001 |
4 | 1102210213122301013011 |
5 | 1220431443130020331 |
6 | 20022424331013301 |
7 | 1123645524523156 |
oct | 122444732610705 |
9 | 22073348203731 |
10 | 5674313126341 |
11 | 189850a915852 |
12 | 777877b9a231 |
13 | 322115903182 |
14 | 1588d13c592d |
15 | 9c906678561 |
hex | 529276b11c5 |
5674313126341 has 4 divisors (see below), whose sum is σ = 5676833925184. Its totient is φ = 5671792327500.
The previous prime is 5674313126333. The next prime is 5674313126347. The reversal of 5674313126341 is 1436213134765.
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 5674313126341 - 23 = 5674313126333 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5674313126291 and 5674313126300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5674313126347) 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, 1260396045 + ... + 1260400546.
It is an arithmetic number, because the mean of its divisors is an integer number (1419208481296).
Almost surely, 25674313126341 is an apocalyptic number.
It is an amenable number.
5674313126341 is a deficient number, since it is larger than the sum of its proper divisors (2520798843).
5674313126341 is a wasteful number, since it uses less digits than its factorization.
5674313126341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2520798842.
The product of its digits is 1088640, while the sum is 46.
The spelling of 5674313126341 in words is "five trillion, six hundred seventy-four billion, three hundred thirteen million, one hundred twenty-six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •