Base | Representation |
---|---|
bin | 100011011100011000101… |
… | …0100111100001110101111 |
3 | 122020200201200220120012001 |
4 | 1012320301110330032233 |
5 | 1114302431021034311 |
6 | 14205504223553131 |
7 | 1011640601642461 |
oct | 106706124741657 |
9 | 18220650816161 |
10 | 4871320486831 |
11 | 1608a08468767 |
12 | 66811745b7a7 |
13 | 29449594b5b6 |
14 | 12bab7812131 |
15 | 86aaa7984c1 |
hex | 46e3153c3af |
4871320486831 has 4 divisors (see below), whose sum is σ = 4871994352200. Its totient is φ = 4870646621464.
The previous prime is 4871320486817. The next prime is 4871320486849. The reversal of 4871320486831 is 1386840231784.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4871320486831 - 213 = 4871320478639 is a prime.
It is a super-2 number, since 2×48713204868312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4871320486811) 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, 336921841 + ... + 336936298.
It is an arithmetic number, because the mean of its divisors is an integer number (1217998588050).
Almost surely, 24871320486831 is an apocalyptic number.
4871320486831 is a deficient number, since it is larger than the sum of its proper divisors (673865369).
4871320486831 is an equidigital number, since it uses as much as digits as its factorization.
4871320486831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 673865368.
The product of its (nonzero) digits is 6193152, while the sum is 55.
The spelling of 4871320486831 in words is "four trillion, eight hundred seventy-one billion, three hundred twenty million, four hundred eighty-six thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •