Base | Representation |
---|---|
bin | 1000110110001111… |
… | …01101100010010011 |
3 | 110021000220122220001 |
4 | 10123013231202103 |
5 | 34211443124101 |
6 | 2103200230431 |
7 | 225465052453 |
oct | 43307554223 |
9 | 13230818801 |
10 | 4749973651 |
11 | 2018266565 |
12 | b0690b417 |
13 | 5a910a1c7 |
14 | 330bb9d63 |
15 | 1cc019901 |
hex | 11b1ed893 |
4749973651 has 4 divisors (see below), whose sum is σ = 4751599392. Its totient is φ = 4748347912.
The previous prime is 4749973637. The next prime is 4749973661. The reversal of 4749973651 is 1563799474.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1563799474 = 2 ⋅781899737.
It is a cyclic number.
It is not a de Polignac number, because 4749973651 - 25 = 4749973619 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4749973592 and 4749973601.
It is not an unprimeable number, because it can be changed into a prime (4749973661) 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, 808480 + ... + 814333.
It is an arithmetic number, because the mean of its divisors is an integer number (1187899848).
Almost surely, 24749973651 is an apocalyptic number.
4749973651 is a deficient number, since it is larger than the sum of its proper divisors (1625741).
4749973651 is a wasteful number, since it uses less digits than its factorization.
4749973651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1625740.
The product of its digits is 5715360, while the sum is 55.
The square root of 4749973651 is about 68920.0526044489. The cubic root of 4749973651 is about 1680.9845951590.
The spelling of 4749973651 in words is "four billion, seven hundred forty-nine million, nine hundred seventy-three thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •