Base | Representation |
---|---|
bin | 101101011110111000001110… |
… | …000110011001111101000100 |
3 | 222020021001211102022011121221 |
4 | 231132320032012121331010 |
5 | 202204324210102412400 |
6 | 1545234212041450124 |
7 | 60063661033423513 |
oct | 5536701606317504 |
9 | 866231742264557 |
10 | 200034043404100 |
11 | 58811a63696764 |
12 | 1a527b304a0944 |
13 | 878018b261789 |
14 | 37579b108067a |
15 | 181d527b63c1a |
hex | b5ee0e199f44 |
200034043404100 has 18 divisors (see below), whose sum is σ = 434073874187114. Its totient is φ = 80013617361600.
The previous prime is 200034043404049. The next prime is 200034043404113. The reversal of 200034043404100 is 1404340430002.
It can be written as a sum of positive squares in 3 ways, for example, as 68972393821444 + 131061649582656 = 8304962^2 + 11448216^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1000170216921 + ... + 1000170217120.
Almost surely, 2200034043404100 is an apocalyptic number.
200034043404100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200034043404100 is an abundant number, since it is smaller than the sum of its proper divisors (234039830783014).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200034043404100 is a wasteful number, since it uses less digits than its factorization.
200034043404100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2000340434055 (or 2000340434048 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 25.
Adding to 200034043404100 its reverse (1404340430002), we get a palindrome (201438383834102).
The spelling of 200034043404100 in words is "two hundred trillion, thirty-four billion, forty-three million, four hundred four thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •