Base | Representation |
---|---|
bin | 100011111111110011110… |
… | …1001101100011000010001 |
3 | 122111222002101022111210102 |
4 | 1013333213221230120101 |
5 | 1122024230304334043 |
6 | 14304445031342145 |
7 | 1020303013434335 |
oct | 107774751543021 |
9 | 18458071274712 |
10 | 4947393824273 |
11 | 16381a592107a |
12 | 67aa08221955 |
13 | 29b6ca3cb634 |
14 | 131652c877c5 |
15 | 88a5e17b6b8 |
hex | 47fe7a6c611 |
4947393824273 has 4 divisors (see below), whose sum is σ = 4954052497728. Its totient is φ = 4940735150820.
The previous prime is 4947393824267. The next prime is 4947393824279. The reversal of 4947393824273 is 3724283937494.
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 an interprime number because it is at equal distance from previous prime (4947393824267) and next prime (4947393824279).
It is a cyclic number.
It is not a de Polignac number, because 4947393824273 - 24 = 4947393824257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4947393824279) 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, 3329335613 + ... + 3329337098.
It is an arithmetic number, because the mean of its divisors is an integer number (1238513124432).
Almost surely, 24947393824273 is an apocalyptic number.
It is an amenable number.
4947393824273 is a deficient number, since it is larger than the sum of its proper divisors (6658673455).
4947393824273 is an equidigital number, since it uses as much as digits as its factorization.
4947393824273 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6658673454.
The product of its digits is 219469824, while the sum is 65.
The spelling of 4947393824273 in words is "four trillion, nine hundred forty-seven billion, three hundred ninety-three million, eight hundred twenty-four thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.583 sec. • engine limits •