Base | Representation |
---|---|
bin | 101101100001100110011011… |
… | …100010101100101110100100 |
3 | 222020220221122201021220200020 |
4 | 231201212123202230232210 |
5 | 202220410303100032322 |
6 | 1545500145321515140 |
7 | 60113332336321122 |
oct | 5541463342545644 |
9 | 866827581256606 |
10 | 200221100002212 |
11 | 5888432321a503 |
12 | 1a558235342ab0 |
13 | 87949cbb37663 |
14 | 3762a7812a912 |
15 | 1823324b1605c |
hex | b6199b8acba4 |
200221100002212 has 48 divisors (see below), whose sum is σ = 494681604484032. Its totient is φ = 62812213811200.
The previous prime is 200221100002207. The next prime is 200221100002303. The reversal of 200221100002212 is 212200001122002.
200221100002212 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 200221100002191 and 200221100002200.
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, 11853414 + ... + 23258237.
It is an arithmetic number, because the mean of its divisors is an integer number (10305866760084).
Almost surely, 2200221100002212 is an apocalyptic number.
It is an amenable number.
200221100002212 is an abundant number, since it is smaller than the sum of its proper divisors (294460504481820).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200221100002212 is a wasteful number, since it uses less digits than its factorization.
200221100002212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35139628 (or 35139626 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 200221100002212 its reverse (212200001122002), we get a palindrome (412421101124214).
The spelling of 200221100002212 in words is "two hundred trillion, two hundred twenty-one billion, one hundred million, two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •