Base | Representation |
---|---|
bin | 100011011010110000111… |
… | …1001011000011101110101 |
3 | 122020100202011110202100211 |
4 | 1012311201321120131311 |
5 | 1114223314114104431 |
6 | 14204131025105421 |
7 | 1011455423341654 |
oct | 106654171303565 |
9 | 18210664422324 |
10 | 4867840378741 |
11 | 1607491a97a7a |
12 | 667505a88271 |
13 | 29405c958142 |
14 | 12b86755119b |
15 | 86954eba2b1 |
hex | 46d61e58775 |
4867840378741 has 4 divisors (see below), whose sum is σ = 4872853603584. Its totient is φ = 4862827153900.
The previous prime is 4867840378717. The next prime is 4867840378763. The reversal of 4867840378741 is 1478730487684.
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 4867840378741 - 219 = 4867839854453 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4867840379741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2506610965 + ... + 2506612906.
It is an arithmetic number, because the mean of its divisors is an integer number (1218213400896).
Almost surely, 24867840378741 is an apocalyptic number.
It is an amenable number.
4867840378741 is a deficient number, since it is larger than the sum of its proper divisors (5013224843).
4867840378741 is an equidigital number, since it uses as much as digits as its factorization.
4867840378741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5013224842.
The product of its (nonzero) digits is 202309632, while the sum is 67.
The spelling of 4867840378741 in words is "four trillion, eight hundred sixty-seven billion, eight hundred forty million, three hundred seventy-eight thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •