Base | Representation |
---|---|
bin | 1001010000110011… |
… | …10001011000011101 |
3 | 110211120020000101000 |
4 | 10220121301120131 |
5 | 40141014434210 |
6 | 2141240340513 |
7 | 234142126413 |
oct | 45031613035 |
9 | 13746200330 |
10 | 4972811805 |
11 | 2122028125 |
12 | b69474739 |
13 | 61332c6c0 |
14 | 3526252b3 |
15 | 1e1885ac0 |
hex | 12867161d |
4972811805 has 64 divisors (see below), whose sum is σ = 9676880640. Its totient is φ = 2407968000.
The previous prime is 4972811771. The next prime is 4972811819. The reversal of 4972811805 is 5081182794.
4972811805 is a `hidden beast` number, since 497 + 2 + 81 + 1 + 80 + 5 = 666.
It is not a de Polignac number, because 4972811805 - 27 = 4972811677 is a prime.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 83830 + ... + 130280.
It is an arithmetic number, because the mean of its divisors is an integer number (151201260).
Almost surely, 24972811805 is an apocalyptic number.
4972811805 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
4972811805 is a deficient number, since it is larger than the sum of its proper divisors (4704068835).
4972811805 is a wasteful number, since it uses less digits than its factorization.
4972811805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46539 (or 46533 counting only the distinct ones).
The product of its (nonzero) digits is 161280, while the sum is 45.
The square root of 4972811805 is about 70518.1664892104. The cubic root of 4972811805 is about 1706.8709011864.
The spelling of 4972811805 in words is "four billion, nine hundred seventy-two million, eight hundred eleven thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •