Base | Representation |
---|---|
bin | 100100011101100000000… |
… | …1011111011101000111001 |
3 | 122202001200002111211212001 |
4 | 1020323000023323220321 |
5 | 1124100321443023343 |
6 | 14354032101021001 |
7 | 1025021060033224 |
oct | 110730013735071 |
9 | 18661602454761 |
10 | 5011156220473 |
11 | 1662246056087 |
12 | 68b2420b4761 |
13 | 2a471c487c60 |
14 | 1347812c05bb |
15 | 8a541d6d44d |
hex | 48ec02fba39 |
5011156220473 has 8 divisors (see below), whose sum is σ = 5406948387008. Its totient is φ = 4616838141264.
The previous prime is 5011156220461. The next prime is 5011156220489. The reversal of 5011156220473 is 3740226511105.
5011156220473 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5011156220473 is a prime.
It is a super-2 number, since 2×50111562204732 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5011156220443) 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, 368514765 + ... + 368528362.
It is an arithmetic number, because the mean of its divisors is an integer number (675868548376).
Almost surely, 25011156220473 is an apocalyptic number.
It is an amenable number.
5011156220473 is a deficient number, since it is larger than the sum of its proper divisors (395792166535).
5011156220473 is a wasteful number, since it uses less digits than its factorization.
5011156220473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 737043663.
The product of its (nonzero) digits is 50400, while the sum is 37.
The spelling of 5011156220473 in words is "five trillion, eleven billion, one hundred fifty-six million, two hundred twenty thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •