Base | Representation |
---|---|
bin | 100100111000000011001… |
… | …1111001001000110110101 |
3 | 122221111211111102221102101 |
4 | 1021300012133021012311 |
5 | 1131014103040030331 |
6 | 14440141341142101 |
7 | 1032106661131642 |
oct | 111600637110665 |
9 | 18844744387371 |
10 | 5068170236341 |
11 | 1684442a76063 |
12 | 69a2b3b5a931 |
13 | 2a9c073ca314 |
14 | 13742d378dc9 |
15 | 8bc7c39a061 |
hex | 49c067c91b5 |
5068170236341 has 4 divisors (see below), whose sum is σ = 5288525464032. Its totient is φ = 4847815008652.
The previous prime is 5068170236333. The next prime is 5068170236359. The reversal of 5068170236341 is 1436320718605.
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 5068170236341 - 23 = 5068170236333 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5068170236291 and 5068170236300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5068170236141) 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, 110177613811 + ... + 110177613856.
It is an arithmetic number, because the mean of its divisors is an integer number (1322131366008).
Almost surely, 25068170236341 is an apocalyptic number.
It is an amenable number.
5068170236341 is a deficient number, since it is larger than the sum of its proper divisors (220355227691).
5068170236341 is a wasteful number, since it uses less digits than its factorization.
5068170236341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 220355227690.
The product of its (nonzero) digits is 725760, while the sum is 46.
The spelling of 5068170236341 in words is "five trillion, sixty-eight billion, one hundred seventy million, two hundred thirty-six thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •