Base | Representation |
---|---|
bin | 1001010011000000010111… |
… | …1001000001110010110111 |
3 | 1100012020002012002011202111 |
4 | 2110300011321001302313 |
5 | 2314434400434000434 |
6 | 33423551052551451 |
7 | 2103344454605110 |
oct | 224600571016267 |
9 | 40166065064674 |
10 | 10222121000119 |
11 | 32911a48a5aa6 |
12 | 1191147782587 |
13 | 591c323b3882 |
14 | 274a7908b207 |
15 | 12ad7a447964 |
hex | 94c05e41cb7 |
10222121000119 has 8 divisors (see below), whose sum is σ = 11682681668480. Its totient is φ = 8761624748856.
The previous prime is 10222121000101. The next prime is 10222121000153. The reversal of 10222121000119 is 91100012122201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10222121000119 - 211 = 10222120998071 is a prime.
It is a super-2 number, since 2×102221210001192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10222121000119.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10222121000159) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15763749 + ... + 16399390.
It is an arithmetic number, because the mean of its divisors is an integer number (1460335208560).
Almost surely, 210222121000119 is an apocalyptic number.
10222121000119 is a deficient number, since it is larger than the sum of its proper divisors (1460560668361).
10222121000119 is an equidigital number, since it uses as much as digits as its factorization.
10222121000119 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32208549.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 10222121000119 in words is "ten trillion, two hundred twenty-two billion, one hundred twenty-one million, one hundred nineteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •