Base | Representation |
---|---|
bin | 111111001011111… |
… | …1011000000011011 |
3 | 12110202112022221001 |
4 | 1332113323000123 |
5 | 13320232401334 |
6 | 550215125431 |
7 | 103353255514 |
oct | 17627730033 |
9 | 5422468831 |
10 | 2120200219 |
11 | 998885895 |
12 | 4b2073877 |
13 | 27a341457 |
14 | 161827a0b |
15 | c6207714 |
hex | 7e5fb01b |
2120200219 has 4 divisors (see below), whose sum is σ = 2120486544. Its totient is φ = 2119913896.
The previous prime is 2120200213. The next prime is 2120200231. The reversal of 2120200219 is 9120020212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2120200219 - 27 = 2120200091 is a prime.
It is a super-2 number, since 2×21202002192 = 8990497937295295922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2120200196 and 2120200205.
It is not an unprimeable number, because it can be changed into a prime (2120200213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 131752 + ... + 146965.
It is an arithmetic number, because the mean of its divisors is an integer number (530121636).
Almost surely, 22120200219 is an apocalyptic number.
2120200219 is a deficient number, since it is larger than the sum of its proper divisors (286325).
2120200219 is an equidigital number, since it uses as much as digits as its factorization.
2120200219 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286324.
The product of its (nonzero) digits is 144, while the sum is 19.
The square root of 2120200219 is about 46045.6319209542. The cubic root of 2120200219 is about 1284.6720978963.
The spelling of 2120200219 in words is "two billion, one hundred twenty million, two hundred thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •