Base | Representation |
---|---|
bin | 10010101011001001110… |
… | …10100100000000100110 |
3 | 2021100012012212211101100 |
4 | 21111210322210000212 |
5 | 41003041124404200 |
6 | 1210433344340530 |
7 | 64233342133662 |
oct | 11254472440046 |
9 | 2240165784340 |
10 | 641643200550 |
11 | 22813494a520 |
12 | a4431014746 |
13 | 48678290091 |
14 | 230acb8d8a2 |
15 | 11a55c38d00 |
hex | 9564ea4026 |
641643200550 has 144 divisors (see below), whose sum is σ = 1887919134192. Its totient is φ = 154944307200.
The previous prime is 641643200537. The next prime is 641643200609. The reversal of 641643200550 is 55002346146.
641643200550 is a `hidden beast` number, since 6 + 4 + 1 + 643 + 2 + 0 + 0 + 5 + 5 + 0 = 666.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1019962 + ... + 1524338.
It is an arithmetic number, because the mean of its divisors is an integer number (13110549543).
Almost surely, 2641643200550 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 641643200550, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (943959567096).
641643200550 is an abundant number, since it is smaller than the sum of its proper divisors (1246275933642).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
641643200550 is a wasteful number, since it uses less digits than its factorization.
641643200550 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 504663 (or 504655 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
Adding to 641643200550 its reverse (55002346146), we get a palindrome (696645546696).
The spelling of 641643200550 in words is "six hundred forty-one billion, six hundred forty-three million, two hundred thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •