Base | Representation |
---|---|
bin | 10110110101100110011101… |
… | …00000010100000101001101 |
3 | 20120211000011122002020222201 |
4 | 23122303032200110011031 |
5 | 23040302003340432224 |
6 | 254450503535241501 |
7 | 13402201631306614 |
oct | 1332631640240515 |
9 | 216730148066881 |
10 | 50220222202189 |
11 | 15002305216086 |
12 | 5771022979291 |
13 | 2203992478960 |
14 | c589592d287b |
15 | 5c15235e2a44 |
hex | 2dacce81414d |
50220222202189 has 4 divisors (see below), whose sum is σ = 54083316217756. Its totient is φ = 46357128186624.
The previous prime is 50220222202187. The next prime is 50220222202237. The reversal of 50220222202189 is 98120222202205.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 34517563777225 + 15702658424964 = 5875165^2 + 3962658^2 .
It is a cyclic number.
It is not a de Polignac number, because 50220222202189 - 21 = 50220222202187 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50220222202187) 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, 1931547007764 + ... + 1931547007789.
It is an arithmetic number, because the mean of its divisors is an integer number (13520829054439).
Almost surely, 250220222202189 is an apocalyptic number.
It is an amenable number.
50220222202189 is a deficient number, since it is larger than the sum of its proper divisors (3863094015567).
50220222202189 is a wasteful number, since it uses less digits than its factorization.
50220222202189 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3863094015566.
The product of its (nonzero) digits is 46080, while the sum is 37.
The spelling of 50220222202189 in words is "fifty trillion, two hundred twenty billion, two hundred twenty-two million, two hundred two thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •