Base | Representation |
---|---|
bin | 100100101100001001010… |
… | …0010100110111000000000 |
3 | 122212001211122112212120000 |
4 | 1021120102202212320000 |
5 | 1130104222240330040 |
6 | 14420312323320000 |
7 | 1030213252313655 |
oct | 111302242467000 |
9 | 18761748485500 |
10 | 5042602667520 |
11 | 16746128221a0 |
12 | 695359520000 |
13 | 2a7691411982 |
14 | 1360c588bc2c |
15 | 8b282964130 |
hex | 496128a6e00 |
5042602667520 has 1600 divisors, whose sum is σ = 20693253689856. Its totient is φ = 1161720299520.
The previous prime is 5042602667489. The next prime is 5042602667533. The reversal of 5042602667520 is 257662062405.
5042602667520 is a `hidden beast` number, since 5 + 0 + 4 + 2 + 60 + 2 + 6 + 67 + 520 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 14531995987 + ... + 14531996333.
Almost surely, 25042602667520 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 5042602667520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10346626844928).
5042602667520 is an abundant number, since it is smaller than the sum of its proper divisors (15650651022336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5042602667520 is a wasteful number, since it uses less digits than its factorization.
5042602667520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 693 (or 668 counting only the distinct ones).
The product of its (nonzero) digits is 1209600, while the sum is 45.
The spelling of 5042602667520 in words is "five trillion, forty-two billion, six hundred two million, six hundred sixty-seven thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •