Base | Representation |
---|---|
bin | 1001010000011111… |
… | …11111110101010100 |
3 | 110211101101211121220 |
4 | 10220033333311110 |
5 | 40134340441211 |
6 | 2141105410340 |
7 | 234111265326 |
oct | 45017776524 |
9 | 13741354556 |
10 | 4970249556 |
11 | 2120638068 |
12 | b686399b0 |
13 | 61294338c |
14 | 352159616 |
15 | 1e152b806 |
hex | 1283ffd54 |
4970249556 has 12 divisors (see below), whose sum is σ = 11597248992. Its totient is φ = 1656749848.
The previous prime is 4970249551. The next prime is 4970249563. The reversal of 4970249556 is 6559420794.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 4970249499 and 4970249508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4970249551) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 207093720 + ... + 207093743.
It is an arithmetic number, because the mean of its divisors is an integer number (966437416).
Almost surely, 24970249556 is an apocalyptic number.
It is an amenable number.
4970249556 is an abundant number, since it is smaller than the sum of its proper divisors (6626999436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4970249556 is a wasteful number, since it uses less digits than its factorization.
4970249556 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 414187470 (or 414187468 counting only the distinct ones).
The product of its (nonzero) digits is 2721600, while the sum is 51.
The square root of 4970249556 is about 70499.9968510638. The cubic root of 4970249556 is about 1706.5776948620.
The spelling of 4970249556 in words is "four billion, nine hundred seventy million, two hundred forty-nine thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •