Base | Representation |
---|---|
bin | 100100011000010011111… |
… | …0001000010101100010010 |
3 | 122200222220020020110100002 |
4 | 1020300213301002230102 |
5 | 1123410004312200200 |
6 | 14344550015330002 |
7 | 1024144613052656 |
oct | 110604761025422 |
9 | 18628806213302 |
10 | 5000009100050 |
11 | 1658545872568 |
12 | 689050b20902 |
13 | 2a3663c2c303 |
14 | 134004a74a66 |
15 | 8a0dd41cbd5 |
hex | 48c27c42b12 |
5000009100050 has 48 divisors (see below), whose sum is σ = 9483990753600. Its totient is φ = 1960628241600.
The previous prime is 5000009100029. The next prime is 5000009100059. The reversal of 5000009100050 is 500019000005.
It is a junction number, because it is equal to n+sod(n) for n = 5000009099995 and 5000009100031.
It is not an unprimeable number, because it can be changed into a prime (5000009100059) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1301561 + ... + 3419660.
It is an arithmetic number, because the mean of its divisors is an integer number (197583140700).
Almost surely, 25000009100050 is an apocalyptic number.
5000009100050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5000009100050 is a deficient number, since it is larger than the sum of its proper divisors (4483981653550).
5000009100050 is a wasteful number, since it uses less digits than its factorization.
5000009100050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4721651 (or 4721646 counting only the distinct ones).
The product of its (nonzero) digits is 225, while the sum is 20.
The spelling of 5000009100050 in words is "five trillion, nine million, one hundred thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •