Base | Representation |
---|---|
bin | 101111110000001110011010… |
… | …101111101100101001100011 |
3 | 1000112121221000100211212112212 |
4 | 233300032122233230221203 |
5 | 210012000432203031034 |
6 | 2022402511224312335 |
7 | 62144413644614021 |
oct | 5760163257545143 |
9 | 1015557010755485 |
10 | 210022202002019 |
11 | 60a12a08843070 |
12 | 1b67b8626126ab |
13 | 90260160749b4 |
14 | 39c11b3677711 |
15 | 194325d2132ce |
hex | bf039abeca63 |
210022202002019 has 8 divisors (see below), whose sum is σ = 231477141101808. Its totient is φ = 188960931509760.
The previous prime is 210022202001967. The next prime is 210022202002051. The reversal of 210022202002019 is 910200202220012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 210022202002019 - 220 = 210022200953443 is a prime.
It is a super-2 number, since 2×2100222020020192 (a number of 29 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 = 210022202001985 and 210022202002003.
It is not an unprimeable number, because it can be changed into a prime (210022202008019) 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, 98417150762 + ... + 98417152895.
It is an arithmetic number, because the mean of its divisors is an integer number (28934642637726).
Almost surely, 2210022202002019 is an apocalyptic number.
210022202002019 is a deficient number, since it is larger than the sum of its proper divisors (21454939099789).
210022202002019 is a wasteful number, since it uses less digits than its factorization.
210022202002019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196834303765.
The product of its (nonzero) digits is 576, while the sum is 23.
The spelling of 210022202002019 in words is "two hundred ten trillion, twenty-two billion, two hundred two million, two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •