Base | Representation |
---|---|
bin | 101101011110100011111110… |
… | …110111011111100111010000 |
3 | 222020011222201222201021202021 |
4 | 231132203332313133213100 |
5 | 202204000204112003100 |
6 | 1545220215455501224 |
7 | 60062261400145045 |
oct | 5536437667374720 |
9 | 866158658637667 |
10 | 200012313000400 |
11 | 5880382241883a |
12 | 1a523886b27814 |
13 | 877b107223934 |
14 | 375690d03b1cc |
15 | 181cba503aa1a |
hex | b5e8feddf9d0 |
200012313000400 has 120 divisors (see below), whose sum is σ = 497067354160160. Its totient is φ = 77282610209280.
The previous prime is 200012313000391. The next prime is 200012313000553. The reversal of 200012313000400 is 4000313210002.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 46555554 + ... + 50669953.
Almost surely, 2200012313000400 is an apocalyptic number.
200012313000400 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200012313000400 is an abundant number, since it is smaller than the sum of its proper divisors (297055041159760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200012313000400 is a wasteful number, since it uses less digits than its factorization.
200012313000400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97225701 (or 97225690 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 200012313000400 its reverse (4000313210002), we get a palindrome (204012626210402).
The spelling of 200012313000400 in words is "two hundred trillion, twelve billion, three hundred thirteen million, four hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •