Base | Representation |
---|---|
bin | 100100011101101011101… |
… | …0101110000001000000000 |
3 | 122202002200011110011102020 |
4 | 1020323113111300020000 |
5 | 1124102120413430340 |
6 | 14354134414521440 |
7 | 1025033514562230 |
oct | 110732725601000 |
9 | 18662604404366 |
10 | 5011544670720 |
11 | 1662425352545 |
12 | 68b330206280 |
13 | 2a4781ab4483 |
14 | 1347bab19cc0 |
15 | 8a565eee9d0 |
hex | 48ed7570200 |
5011544670720 has 320 divisors, whose sum is σ = 18341883115776. Its totient is φ = 1143503585280.
The previous prime is 5011544670689. The next prime is 5011544670757. The reversal of 5011544670720 is 270764451105.
It is a tau number, because it is divible by the number of its divisors (320).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 30938740 + ... + 31100300.
Almost surely, 25011544670720 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5011544670720, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9170941557888).
5011544670720 is an abundant number, since it is smaller than the sum of its proper divisors (13330338445056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5011544670720 is a wasteful number, since it uses less digits than its factorization.
5011544670720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162171 (or 162155 counting only the distinct ones).
The product of its (nonzero) digits is 235200, while the sum is 42.
The spelling of 5011544670720 in words is "five trillion, eleven billion, five hundred forty-four million, six hundred seventy thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •