Base | Representation |
---|---|
bin | 1000111100011110… |
… | …00010100100001000 |
3 | 110101200020101020112 |
4 | 10132033002210020 |
5 | 34313332221230 |
6 | 2112304213452 |
7 | 230001152114 |
oct | 43617024410 |
9 | 13350211215 |
10 | 4802226440 |
11 | 2044805890 |
12 | b2030a288 |
13 | 5b6ba3b0b |
14 | 337adc744 |
15 | 1d18dbd95 |
hex | 11e3c2908 |
4802226440 has 64 divisors (see below), whose sum is σ = 12407688000. Its totient is φ = 1654352640.
The previous prime is 4802226431. The next prime is 4802226463. The reversal of 4802226440 is 446222084.
It is a super-2 number, since 2×48022264402 = 46122757562070147200, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4802226397 and 4802226406.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 278855 + ... + 295574.
It is an arithmetic number, because the mean of its divisors is an integer number (193870125).
Almost surely, 24802226440 is an apocalyptic number.
4802226440 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
4802226440 is an abundant number, since it is smaller than the sum of its proper divisors (7605461560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4802226440 is a wasteful number, since it uses less digits than its factorization.
4802226440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 574470 (or 574466 counting only the distinct ones).
The product of its (nonzero) digits is 24576, while the sum is 32.
The square root of 4802226440 is about 69298.0983866080. The cubic root of 4802226440 is about 1687.1261030974.
The spelling of 4802226440 in words is "four billion, eight hundred two million, two hundred twenty-six thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •