Base | Representation |
---|---|
bin | 100000101000001110010… |
… | …111101100101111010110 |
3 | 21221100112202021001022120 |
4 | 200220032113230233112 |
5 | 243214023242201402 |
6 | 4434020420040410 |
7 | 320665103502555 |
oct | 40501627545726 |
9 | 7840482231276 |
10 | 2242214022102 |
11 | 794a103a765a |
12 | 302680b33106 |
13 | 133594536942 |
14 | 7a7491c9d9c |
15 | 3d4d24c53bc |
hex | 20a0e5ecbd6 |
2242214022102 has 8 divisors (see below), whose sum is σ = 4484428044216. Its totient is φ = 747404674032.
The previous prime is 2242214022091. The next prime is 2242214022107. The reversal of 2242214022102 is 2012204122422.
2242214022102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
2242214022102 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2242214022107) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 186851168503 + ... + 186851168514.
It is an arithmetic number, because the mean of its divisors is an integer number (560553505527).
Almost surely, 22242214022102 is an apocalyptic number.
2242214022102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2242214022102 is a wasteful number, since it uses less digits than its factorization.
2242214022102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373702337022.
The product of its (nonzero) digits is 2048, while the sum is 24.
Adding to 2242214022102 its reverse (2012204122422), we get a palindrome (4254418144524).
The spelling of 2242214022102 in words is "two trillion, two hundred forty-two billion, two hundred fourteen million, twenty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •