Base | Representation |
---|---|
bin | 1000111011101000… |
… | …11010010100110011 |
3 | 110101012002201201002 |
4 | 10131310122110303 |
5 | 34310040332000 |
6 | 2111454432215 |
7 | 226554626450 |
oct | 43564322463 |
9 | 13335081632 |
10 | 4795245875 |
11 | 2040878222 |
12 | b19b0266b |
13 | 5b55cb6c4 |
14 | 336c02827 |
15 | 1d0ead8d5 |
hex | 11dd1a533 |
4795245875 has 24 divisors (see below), whose sum is σ = 6842313504. Its totient is φ = 3286764000.
The previous prime is 4795245869. The next prime is 4795245877. The reversal of 4795245875 is 5785425974.
It is not a de Polignac number, because 4795245875 - 28 = 4795245619 is a prime.
It is a Duffinian number.
Its product of digits (14112000) is a multiple of the sum of its prime factors (4704).
It is a self number, because there is not a number n which added to its sum of digits gives 4795245875.
It is not an unprimeable number, because it can be changed into a prime (4795245877) 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 23 ways as a sum of consecutive naturals, for example, 2047205 + ... + 2049545.
It is an arithmetic number, because the mean of its divisors is an integer number (285096396).
Almost surely, 24795245875 is an apocalyptic number.
4795245875 is a deficient number, since it is larger than the sum of its proper divisors (2047067629).
4795245875 is an frugal number, since it uses more digits than its factorization.
4795245875 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4704 (or 2353 counting only the distinct ones).
The product of its digits is 14112000, while the sum is 56.
The square root of 4795245875 is about 69247.7138611810. The cubic root of 4795245875 is about 1686.3082321494.
The spelling of 4795245875 in words is "four billion, seven hundred ninety-five million, two hundred forty-five thousand, eight hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •