Base | Representation |
---|---|
bin | 1011101001111000101… |
… | …0110100011110010111 |
3 | 201010210211021011110221 |
4 | 2322132022310132113 |
5 | 11240023331211434 |
6 | 231551503055211 |
7 | 20315456020342 |
oct | 2723612643627 |
9 | 633724234427 |
10 | 200222132119 |
11 | 77a061a0369 |
12 | 32979ba1507 |
13 | 15b5b3551b9 |
14 | 99957c5459 |
15 | 531cc012b4 |
hex | 2e9e2b4797 |
200222132119 has 4 divisors (see below), whose sum is σ = 200228966496. Its totient is φ = 200215297744.
The previous prime is 200222132113. The next prime is 200222132147. The reversal of 200222132119 is 911231222002.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 911231222002 = 2 ⋅455615611001.
It is a cyclic number.
It is not a de Polignac number, because 200222132119 - 25 = 200222132087 is a prime.
It is a super-2 number, since 2×2002221321192 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200222132093 and 200222132102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200222132113) 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, 3373054 + ... + 3431899.
It is an arithmetic number, because the mean of its divisors is an integer number (50057241624).
Almost surely, 2200222132119 is an apocalyptic number.
200222132119 is a deficient number, since it is larger than the sum of its proper divisors (6834377).
200222132119 is an equidigital number, since it uses as much as digits as its factorization.
200222132119 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6834376.
The product of its (nonzero) digits is 864, while the sum is 25.
The spelling of 200222132119 in words is "two hundred billion, two hundred twenty-two million, one hundred thirty-two thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •