Base | Representation |
---|---|
bin | 101101100001011100010011… |
… | …001010011101011001100000 |
3 | 222020212220120121102202101212 |
4 | 231201130103022131121200 |
5 | 202220221013313341000 |
6 | 1545451150052445252 |
7 | 60112465641040004 |
oct | 5541342312353140 |
9 | 866786517382355 |
10 | 200210222012000 |
11 | 5887a750946452 |
12 | 1a5560ba319828 |
13 | 879398728b965 |
14 | 376232553a704 |
15 | 1822dd9b27c35 |
hex | b6171329d660 |
200210222012000 has 96 divisors (see below), whose sum is σ = 492168928960800. Its totient is φ = 80042995852800.
The previous prime is 200210222011999. The next prime is 200210222012027. The reversal of 200210222012000 is 210222012002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5044574 + ... + 20636573.
It is an arithmetic number, because the mean of its divisors is an integer number (5126759676675).
Almost surely, 2200210222012000 is an apocalyptic number.
200210222012000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200210222012000 is an abundant number, since it is smaller than the sum of its proper divisors (291958706948800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200210222012000 is a wasteful number, since it uses less digits than its factorization.
200210222012000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25683121 (or 25683103 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 200210222012000 its reverse (210222012002), we get a palindrome (200420444024002).
It can be divided in two parts, 20021022 and 2012000, that added together give a palindrome (22033022).
The spelling of 200210222012000 in words is "two hundred trillion, two hundred ten billion, two hundred twenty-two million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •