Base | Representation |
---|---|
bin | 100011100110000001001… |
… | …1010000010001011100000 |
3 | 122022200010110100200111110 |
4 | 1013030002122002023200 |
5 | 1120122313040113443 |
6 | 14223205115543320 |
7 | 1013302344001662 |
oct | 107140232021340 |
9 | 18280113320443 |
10 | 4892008129248 |
11 | 16167640666a9 |
12 | 67012b75ab40 |
13 | 296411929926 |
14 | 12cabb176532 |
15 | 873bba95233 |
hex | 473026822e0 |
4892008129248 has 24 divisors (see below), whose sum is σ = 12841521339528. Its totient is φ = 1630669376384.
The previous prime is 4892008129219. The next prime is 4892008129271. The reversal of 4892008129248 is 8429218002984.
It is a tau number, because it is divible by the number of its divisors (24).
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25479208911 + ... + 25479209102.
It is an arithmetic number, because the mean of its divisors is an integer number (535063389147).
Almost surely, 24892008129248 is an apocalyptic number.
4892008129248 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
4892008129248 is an abundant number, since it is smaller than the sum of its proper divisors (7949513210280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4892008129248 is a wasteful number, since it uses less digits than its factorization.
4892008129248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50958418026 (or 50958418018 counting only the distinct ones).
The product of its (nonzero) digits is 5308416, while the sum is 57.
The spelling of 4892008129248 in words is "four trillion, eight hundred ninety-two billion, eight million, one hundred twenty-nine thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •