Base | Representation |
---|---|
bin | 1001010001010111… |
… | …01001010101111101 |
3 | 110211220001001220010 |
4 | 10220223221111331 |
5 | 40143214404334 |
6 | 2141525013433 |
7 | 234230013300 |
oct | 45053512575 |
9 | 13756031803 |
10 | 4977497469 |
11 | 212473857a |
12 | b6ab54279 |
13 | 6142b0399 |
14 | 3530c4b37 |
15 | 1e1eae0e9 |
hex | 128ae957d |
4977497469 has 72 divisors (see below), whose sum is σ = 8270408160. Its totient is φ = 2647681344.
The previous prime is 4977497449. The next prime is 4977497471. The reversal of 4977497469 is 9647947794.
It is not a de Polignac number, because 4977497469 - 211 = 4977495421 is a prime.
It is a super-2 number, since 2×49774974692 = 49550962107802811922, which contains 22 as substring.
Its product of digits (96018048) is a multiple of the sum of its prime factors (567).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4977497429) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 12537579 + ... + 12537975.
It is an arithmetic number, because the mean of its divisors is an integer number (114866780).
Almost surely, 24977497469 is an apocalyptic number.
4977497469 is a gapful number since it is divisible by the number (49) formed by its first and last digit.
It is an amenable number.
4977497469 is a deficient number, since it is larger than the sum of its proper divisors (3292910691).
4977497469 is a wasteful number, since it uses less digits than its factorization.
4977497469 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 567 (or 493 counting only the distinct ones).
The product of its digits is 96018048, while the sum is 66.
The square root of 4977497469 is about 70551.3817653489. The cubic root of 4977497469 is about 1707.4068362644.
The spelling of 4977497469 in words is "four billion, nine hundred seventy-seven million, four hundred ninety-seven thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •