Base | Representation |
---|---|
bin | 1100111011011101100… |
… | …0100110000100100110 |
3 | 210020022220222121202212 |
4 | 3032313120212010212 |
5 | 12114400210310042 |
6 | 250012430403422 |
7 | 22022224635101 |
oct | 3166730460446 |
9 | 706286877685 |
10 | 222120010022 |
11 | 86222a56119 |
12 | 3706b660572 |
13 | 17c3ac9c7c1 |
14 | aa71b81738 |
15 | 5ba03ab482 |
hex | 33b7626126 |
222120010022 has 4 divisors (see below), whose sum is σ = 333180015036. Its totient is φ = 111060005010.
The previous prime is 222120010019. The next prime is 222120010051. The reversal of 222120010022 is 220010021222.
222120010022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 220010021222 = 2 ⋅110005010611.
It is a junction number, because it is equal to n+sod(n) for n = 222120009979 and 222120010006.
It is a congruent number.
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 as a sum of consecutive naturals, namely, 55530002504 + ... + 55530002507.
It is an arithmetic number, because the mean of its divisors is an integer number (83295003759).
Almost surely, 2222120010022 is an apocalyptic number.
222120010022 is a deficient number, since it is larger than the sum of its proper divisors (111060005014).
222120010022 is a wasteful number, since it uses less digits than its factorization.
222120010022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111060005013.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 222120010022 its reverse (220010021222), we get a palindrome (442130031244).
The spelling of 222120010022 in words is "two hundred twenty-two billion, one hundred twenty million, ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •