Base | Representation |
---|---|
bin | 100100011110100001111… |
… | …0000110011100000000000 |
3 | 122202021100221021111220020 |
4 | 1020331003300303200000 |
5 | 1124114332101424020 |
6 | 14355035115013440 |
7 | 1025126553231561 |
oct | 110750360634000 |
9 | 18667327244806 |
10 | 5013363701760 |
11 | 1663179125487 |
12 | 68b75943a280 |
13 | 2a49b19088bb |
14 | 134910548168 |
15 | 8a620a66c40 |
hex | 48f43c33800 |
5013363701760 has 192 divisors, whose sum is σ = 16093616142240. Its totient is φ = 1332331806720.
The previous prime is 5013363701719. The next prime is 5013363701767. The reversal of 5013363701760 is 671073633105.
It is a tau number, because it is divible by the number of its divisors (192).
It is a super-2 number, since 2×50133637017602 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5013363701767) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8722470 + ... + 9279450.
Almost surely, 25013363701760 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 5013363701760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8046808071120).
5013363701760 is an abundant number, since it is smaller than the sum of its proper divisors (11080252440480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5013363701760 is a wasteful number, since it uses less digits than its factorization.
5013363701760 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 557304 (or 557284 counting only the distinct ones).
The product of its (nonzero) digits is 238140, while the sum is 42.
The spelling of 5013363701760 in words is "five trillion, thirteen billion, three hundred sixty-three million, seven hundred one thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •