Base | Representation |
---|---|
bin | 10111001111001101001100… |
… | …000001010011110101010111 |
3 | 111101212020010021020222000120 |
4 | 113033031030001103311113 |
5 | 101343421121142020434 |
6 | 1001210013030043023 |
7 | 30345464552361105 |
oct | 2717151401236527 |
9 | 441766107228016 |
10 | 102200022220119 |
11 | 2a62287121549a |
12 | b5670707a9473 |
13 | 45045614a9285 |
14 | 1b347166c8c75 |
15 | bc36ccb60349 |
hex | 5cf34c053d57 |
102200022220119 has 8 divisors (see below), whose sum is σ = 143438627677440. Its totient is φ = 64547382454776.
The previous prime is 102200022220117. The next prime is 102200022220123. The reversal of 102200022220119 is 911022220002201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102200022220119 - 21 = 102200022220117 is a prime.
It is a super-2 number, since 2×1022000222201192 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102200022220117) 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, 896491422927 + ... + 896491423040.
It is an arithmetic number, because the mean of its divisors is an integer number (17929828459680).
Almost surely, 2102200022220119 is an apocalyptic number.
102200022220119 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
102200022220119 is a deficient number, since it is larger than the sum of its proper divisors (41238605457321).
102200022220119 is a wasteful number, since it uses less digits than its factorization.
102200022220119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1792982845989.
The product of its (nonzero) digits is 576, while the sum is 24.
The spelling of 102200022220119 in words is "one hundred two trillion, two hundred billion, twenty-two million, two hundred twenty thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •