Base | Representation |
---|---|
bin | 100100011001100111000… |
… | …0001011011010101100100 |
3 | 122201021002121211020120220 |
4 | 1020303032001123111210 |
5 | 1123431212343210111 |
6 | 14350130500124340 |
7 | 1024304002611105 |
oct | 110631601332544 |
9 | 18637077736526 |
10 | 5002798413156 |
11 | 1659747310805 |
12 | 6896ab0966b0 |
13 | 2a39b9a8713b |
14 | 1341cb2b63ac |
15 | 8a203245e06 |
hex | 48cce05b564 |
5002798413156 has 48 divisors (see below), whose sum is σ = 11789147733888. Its totient is φ = 1651036032000.
The previous prime is 5002798413133. The next prime is 5002798413157. The reversal of 5002798413156 is 6513148972005.
It is a junction number, because it is equal to n+sod(n) for n = 5002798413099 and 5002798413108.
It is not an unprimeable number, because it can be changed into a prime (5002798413157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 62973396 + ... + 63052788.
It is an arithmetic number, because the mean of its divisors is an integer number (245607244456).
It is a 1-persistent number, because it is pandigital, but 2⋅5002798413156 = 10005596826312 is not.
Almost surely, 25002798413156 is an apocalyptic number.
It is an amenable number.
5002798413156 is an abundant number, since it is smaller than the sum of its proper divisors (6786349320732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5002798413156 is a wasteful number, since it uses less digits than its factorization.
5002798413156 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131492 (or 131490 counting only the distinct ones).
The product of its (nonzero) digits is 1814400, while the sum is 51.
The spelling of 5002798413156 in words is "five trillion, two billion, seven hundred ninety-eight million, four hundred thirteen thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •