Base | Representation |
---|---|
bin | 101101100001011100001101… |
… | …001001001010111100111000 |
3 | 222020212220022120101101002002 |
4 | 231201130031021022330320 |
5 | 202220220311434323000 |
6 | 1545451132044000132 |
7 | 60112463303405312 |
oct | 5541341511127470 |
9 | 866786276341062 |
10 | 200210121011000 |
11 | 5887a6a9930951 |
12 | 1a556090530048 |
13 | 879396c387659 |
14 | 3762315d687b2 |
15 | 1822dd0d268d5 |
hex | b6170d24af38 |
200210121011000 has 32 divisors (see below), whose sum is σ = 468491683168080. Its totient is φ = 80084048404000.
The previous prime is 200210121010981. The next prime is 200210121011009. The reversal of 200210121011000 is 110121012002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200210121011009) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 100105059506 + ... + 100105061505.
Almost surely, 2200210121011000 is an apocalyptic number.
200210121011000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200210121011000 is an abundant number, since it is smaller than the sum of its proper divisors (268281562157080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200210121011000 is a wasteful number, since it uses less digits than its factorization.
200210121011000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200210121032 (or 200210121018 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 200210121011000 its reverse (110121012002), we get a palindrome (200320242023002).
The spelling of 200210121011000 in words is "two hundred trillion, two hundred ten billion, one hundred twenty-one million, eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •