Base | Representation |
---|---|
bin | 101011111100110010000… |
… | …1010001010111110111000 |
3 | 210101110100011120001102010 |
4 | 1113321210022022332320 |
5 | 1242431222011444300 |
6 | 20502531245405520 |
7 | 1162255565204613 |
oct | 127714412127670 |
9 | 23343304501363 |
10 | 6040404406200 |
11 | 1a197a28a589a |
12 | 8168072698a0 |
13 | 34a7b9137368 |
14 | 16c4ddd8b17a |
15 | a71d1203a50 |
hex | 57e6428afb8 |
6040404406200 has 96 divisors (see below), whose sum is σ = 18799856732160. Its totient is φ = 1604357040000.
The previous prime is 6040404406193. The next prime is 6040404406229. The reversal of 6040404406200 is 26044040406.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19903864 + ... + 20205063.
It is an arithmetic number, because the mean of its divisors is an integer number (195831840960).
Almost surely, 26040404406200 is an apocalyptic number.
6040404406200 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
6040404406200 is an abundant number, since it is smaller than the sum of its proper divisors (12759452325960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6040404406200 is a wasteful number, since it uses less digits than its factorization.
6040404406200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40109197 (or 40109188 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 30.
Adding to 6040404406200 its reverse (26044040406), we get a palindrome (6066448446606).
The spelling of 6040404406200 in words is "six trillion, forty billion, four hundred four million, four hundred six thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •