Base | Representation |
---|---|
bin | 101110101101100011001… |
… | …1111010110001111010110 |
3 | 211201202011121210120111200 |
4 | 1131123012133112033112 |
5 | 1320141140334342200 |
6 | 21353151253413330 |
7 | 1231554602126646 |
oct | 135330637261726 |
9 | 24652147716450 |
10 | 6420011246550 |
11 | 2055790a85540 |
12 | 8782a893a246 |
13 | 3775347b2b15 |
14 | 182a31964526 |
15 | b1eec5be800 |
hex | 5d6c67d63d6 |
6420011246550 has 288 divisors, whose sum is σ = 18922515131520. Its totient is φ = 1547616000000.
The previous prime is 6420011246533. The next prime is 6420011246569. The reversal of 6420011246550 is 556421100246.
6420011246550 is a `hidden beast` number, since 6 + 420 + 0 + 1 + 124 + 65 + 50 = 666.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 818770630 + ... + 818778470.
It is an arithmetic number, because the mean of its divisors is an integer number (65703177540).
Almost surely, 26420011246550 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6420011246550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9461257565760).
6420011246550 is an abundant number, since it is smaller than the sum of its proper divisors (12502503884970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6420011246550 is a wasteful number, since it uses less digits than its factorization.
6420011246550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8780 (or 8772 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 36.
Adding to 6420011246550 its reverse (556421100246), we get a palindrome (6976432346796).
The spelling of 6420011246550 in words is "six trillion, four hundred twenty billion, eleven million, two hundred forty-six thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •