Base | Representation |
---|---|
bin | 1100111011000000111… |
… | …0110101001110001010 |
3 | 210020000120011222212010 |
4 | 3032300032311032022 |
5 | 12114124000310442 |
6 | 245552502400350 |
7 | 22016236644132 |
oct | 3166016651612 |
9 | 706016158763 |
10 | 222000010122 |
11 | 86171244450 |
12 | 370374300b6 |
13 | 17c1c175947 |
14 | aa5dc65ac2 |
15 | 5b94aa5b9c |
hex | 33b03b538a |
222000010122 has 32 divisors (see below), whose sum is σ = 484391614464. Its totient is φ = 67268847600.
The previous prime is 222000010103. The next prime is 222000010163. The reversal of 222000010122 is 221010000222.
222000010122 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 = 222000010098 and 222000010107.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1181793 + ... + 1356699.
It is an arithmetic number, because the mean of its divisors is an integer number (15137237952).
Almost surely, 2222000010122 is an apocalyptic number.
222000010122 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
222000010122 is an abundant number, since it is smaller than the sum of its proper divisors (262391604342).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
222000010122 is a wasteful number, since it uses less digits than its factorization.
222000010122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194154.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 222000010122 its reverse (221010000222), we get a palindrome (443010010344).
The spelling of 222000010122 in words is "two hundred twenty-two billion, ten thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •