Base | Representation |
---|---|
bin | 101101011111110110110010… |
… | …010000011100110100000000 |
3 | 222020111111020012200221112220 |
4 | 231133312302100130310000 |
5 | 202211424300313310422 |
6 | 1545325122104251040 |
7 | 60101556551231643 |
oct | 5537666220346400 |
9 | 866444205627486 |
10 | 200101222010112 |
11 | 588384a7218765 |
12 | 1a538b5a470a80 |
13 | 8786605ccb117 |
14 | 375ad450a3a5a |
15 | 182015a710e5c |
hex | b5fdb241cd00 |
200101222010112 has 144 divisors (see below), whose sum is σ = 544635784315392. Its totient is φ = 65203312711680.
The previous prime is 200101222010083. The next prime is 200101222010219. The reversal of 200101222010112 is 211010222101002.
It is a super-2 number, since 2×2001012220101122 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200101222010091 and 200101222010100.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 8101948 + ... + 21583419.
Almost surely, 2200101222010112 is an apocalyptic number.
It is an amenable number.
200101222010112 is an abundant number, since it is smaller than the sum of its proper divisors (344534562305280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200101222010112 is a wasteful number, since it uses less digits than its factorization.
200101222010112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29685584 (or 29685570 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 200101222010112 its reverse (211010222101002), we get a palindrome (411111444111114).
The spelling of 200101222010112 in words is "two hundred trillion, one hundred one billion, two hundred twenty-two million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •