Base | Representation |
---|---|
bin | 10110101111000010111100… |
… | …01101110100000110011000 |
3 | 20120000110211111210012110110 |
4 | 23113201132031310012120 |
5 | 23023104230000130031 |
6 | 254155215210044320 |
7 | 13350006464234223 |
oct | 1327413615640630 |
9 | 216013744705413 |
10 | 49995000005016 |
11 | 14a25840154930 |
12 | 57354484196a0 |
13 | 21b867b896771 |
14 | c4bab15485ba |
15 | 5ba740c09c46 |
hex | 2d785e374198 |
49995000005016 has 64 divisors (see below), whose sum is σ = 142278260901120. Its totient is φ = 14491304347520.
The previous prime is 49995000005009. The next prime is 49995000005051. The reversal of 49995000005016 is 61050000059994.
49995000005016 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4116841755 + ... + 4116853898.
It is an arithmetic number, because the mean of its divisors is an integer number (2223097826580).
Almost surely, 249995000005016 is an apocalyptic number.
49995000005016 is a gapful number since it is divisible by the number (46) formed by its first and last digit.
It is an amenable number.
49995000005016 is an abundant number, since it is smaller than the sum of its proper divisors (92283260896104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49995000005016 is a wasteful number, since it uses less digits than its factorization.
49995000005016 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8233695696 (or 8233695692 counting only the distinct ones).
The product of its (nonzero) digits is 437400, while the sum is 48.
The spelling of 49995000005016 in words is "forty-nine trillion, nine hundred ninety-five billion, five thousand, sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •