Base | Representation |
---|---|
bin | 1000111001000111… |
… | …00111000101000000 |
3 | 110022201020121020210 |
4 | 10130203213011000 |
5 | 34234130030243 |
6 | 2105420434120 |
7 | 226206610146 |
oct | 43443470500 |
9 | 13281217223 |
10 | 4774064448 |
11 | 202a92030a |
12 | b129a8940 |
13 | 5b10c360a |
14 | 33408b596 |
15 | 1ce1c7933 |
hex | 11c8e7140 |
4774064448 has 56 divisors (see below), whose sum is σ = 13066958880. Its totient is φ = 1536478720.
The previous prime is 4774064441. The next prime is 4774064459. The reversal of 4774064448 is 8444604774.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a junction number, because it is equal to n+sod(n) for n = 4774064397 and 4774064406.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4774064441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 423138 + ... + 434273.
Almost surely, 24774064448 is an apocalyptic number.
4774064448 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
4774064448 is an abundant number, since it is smaller than the sum of its proper divisors (8292894432).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4774064448 is a wasteful number, since it uses less digits than its factorization.
4774064448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 857455 (or 857445 counting only the distinct ones).
The product of its (nonzero) digits is 2408448, while the sum is 48.
The square root of 4774064448 is about 69094.6050571244. The cubic root of 4774064448 is about 1683.8216627044.
The spelling of 4774064448 in words is "four billion, seven hundred seventy-four million, sixty-four thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •