Base | Representation |
---|---|
bin | 11101000111000001010… |
… | …000001100011001010000 |
3 | 21002020101110100121201021 |
4 | 131013001100030121100 |
5 | 230233310410243100 |
6 | 4130545542045224 |
7 | 264344553535351 |
oct | 35070120143120 |
9 | 7066343317637 |
10 | 2000402040400 |
11 | 70140288a785 |
12 | 283836719814 |
13 | 11683893b5ba |
14 | 6cb6a025d28 |
15 | 3707d445a1a |
hex | 1d1c140c650 |
2000402040400 has 30 divisors (see below), whose sum is σ = 4805965903022. Its totient is φ = 800160816000.
The previous prime is 2000402040383. The next prime is 2000402040409. The reversal of 2000402040400 is 40402040002.
It can be written as a sum of positive squares in 3 ways, for example, as 23633527824 + 1976768512576 = 153732^2 + 1405976^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000402040409) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2500502151 + ... + 2500502950.
Almost surely, 22000402040400 is an apocalyptic number.
2000402040400 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2000402040400 is an abundant number, since it is smaller than the sum of its proper divisors (2805563862622).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000402040400 is a wasteful number, since it uses less digits than its factorization.
2000402040400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5001005119 (or 5001005108 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 16.
Adding to 2000402040400 its reverse (40402040002), we get a palindrome (2040804080402).
The spelling of 2000402040400 in words is "two trillion, four hundred two million, forty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •