Base | Representation |
---|---|
bin | 101101100001010011110100… |
… | …110001000110001011011110 |
3 | 222020212001002102100221122202 |
4 | 231201103310301012023132 |
5 | 202220043344230042342 |
6 | 1545443043102211502 |
7 | 60112024303131650 |
oct | 5541236461061336 |
9 | 866761072327582 |
10 | 200201122112222 |
11 | 58876901222020 |
12 | 1a55439a883b92 |
13 | 8792b66c0168a |
14 | 3761b00b5c6d0 |
15 | 1822a55cb6332 |
hex | b614f4c462de |
200201122112222 has 32 divisors (see below), whose sum is σ = 374406231882240. Its totient is φ = 77999576064480.
The previous prime is 200201122112213. The next prime is 200201122112249. The reversal of 200201122112222 is 222211221102002.
200201122112222 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 = 200201122112194 and 200201122112203.
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, 6908048 + ... + 21168924.
It is an arithmetic number, because the mean of its divisors is an integer number (11700194746320).
Almost surely, 2200201122112222 is an apocalyptic number.
200201122112222 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
200201122112222 is a deficient number, since it is larger than the sum of its proper divisors (174205109770018).
200201122112222 is a wasteful number, since it uses less digits than its factorization.
200201122112222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14352056.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 200201122112222 its reverse (222211221102002), we get a palindrome (422412343214224).
The spelling of 200201122112222 in words is "two hundred trillion, two hundred one billion, one hundred twenty-two million, one hundred twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •