Base | Representation |
---|---|
bin | 101101011110011010100100… |
… | …110011100111101111111000 |
3 | 222020011000200001002102211020 |
4 | 231132122210303213233320 |
5 | 202203314012244213422 |
6 | 1545211425310302440 |
7 | 60061453156004061 |
oct | 5536324463475770 |
9 | 866130601072736 |
10 | 200002212101112 |
11 | 587aa509758693 |
12 | 1a5219281b7a20 |
13 | 877a187669555 |
14 | 3756231731568 |
15 | 181c7b339b95c |
hex | b5e6a4ce7bf8 |
200002212101112 has 64 divisors (see below), whose sum is σ = 526363694515200. Its totient is φ = 63153543248640.
The previous prime is 200002212101063. The next prime is 200002212101141. The reversal of 200002212101112 is 211101212200002.
It is a junction number, because it is equal to n+sod(n) for n = 200002212101091 and 200002212101100.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11823613 + ... + 23233644.
It is an arithmetic number, because the mean of its divisors is an integer number (8224432726800).
Almost surely, 2200002212101112 is an apocalyptic number.
It is an amenable number.
200002212101112 is an abundant number, since it is smaller than the sum of its proper divisors (326361482414088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200002212101112 is a wasteful number, since it uses less digits than its factorization.
200002212101112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35069796 (or 35069792 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 200002212101112 its reverse (211101212200002), we get a palindrome (411103424301114).
The spelling of 200002212101112 in words is "two hundred trillion, two billion, two hundred twelve million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •