Base | Representation |
---|---|
bin | 1001001000101011… |
… | …00011010111101101 |
3 | 110122210212100012202 |
4 | 10210111203113231 |
5 | 40021034100343 |
6 | 2130402311245 |
7 | 232353246353 |
oct | 44425432755 |
9 | 13583770182 |
10 | 4904596973 |
11 | 2097576331 |
12 | b4a658525 |
13 | 6021675b3 |
14 | 3475497d3 |
15 | 1da8addb8 |
hex | 1245635ed |
4904596973 has 4 divisors (see below), whose sum is σ = 4909877340. Its totient is φ = 4899316608.
The previous prime is 4904596933. The next prime is 4904596987. The reversal of 4904596973 is 3796954094.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1060348969 + 3844248004 = 32563^2 + 62002^2 .
It is a cyclic number.
It is not a de Polignac number, because 4904596973 - 26 = 4904596909 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 (4904596933) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2638790 + ... + 2640647.
It is an arithmetic number, because the mean of its divisors is an integer number (1227469335).
Almost surely, 24904596973 is an apocalyptic number.
It is an amenable number.
4904596973 is a deficient number, since it is larger than the sum of its proper divisors (5280367).
4904596973 is an equidigital number, since it uses as much as digits as its factorization.
4904596973 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5280366.
The product of its (nonzero) digits is 7348320, while the sum is 56.
The square root of 4904596973 is about 70032.8278238142. The cubic root of 4904596973 is about 1699.0302396416.
The spelling of 4904596973 in words is "four billion, nine hundred four million, five hundred ninety-six thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •