Base | Representation |
---|---|
bin | 1001011000111000… |
… | …11000101101100000 |
3 | 111000021210022120220 |
4 | 10230130120231200 |
5 | 40310343343143 |
6 | 2152101403040 |
7 | 235624305312 |
oct | 45434305540 |
9 | 14007708526 |
10 | 5040606048 |
11 | 2157321a25 |
12 | b88109480 |
13 | 6243a823a |
14 | 35b6317b2 |
15 | 1e77c7d83 |
hex | 12c718b60 |
5040606048 has 48 divisors (see below), whose sum is σ = 13236120576. Its totient is φ = 1679626880.
The previous prime is 5040606041. The next prime is 5040606073. The reversal of 5040606048 is 8406060405.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×50406060482 = 50815418662268356608, which contains 22 as substring.
It is a hoax number, since the sum of its digits (33) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5040606041) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 345265 + ... + 359567.
It is an arithmetic number, because the mean of its divisors is an integer number (275752512).
Almost surely, 25040606048 is an apocalyptic number.
It is an amenable number.
5040606048 is an abundant number, since it is smaller than the sum of its proper divisors (8195514528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5040606048 is a wasteful number, since it uses less digits than its factorization.
5040606048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17987 (or 17979 counting only the distinct ones).
The product of its (nonzero) digits is 23040, while the sum is 33.
The square root of 5040606048 is about 70997.2256359359. The cubic root of 5040606048 is about 1714.5924961756.
The spelling of 5040606048 in words is "five billion, forty million, six hundred six thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •