Base | Representation |
---|---|
bin | 1011110000100111101… |
… | …1011101101111011101 |
3 | 201022110211011201022201 |
4 | 2330021323131233131 |
5 | 11302224142434143 |
6 | 232451125011501 |
7 | 20411331025654 |
oct | 2741173355735 |
9 | 638424151281 |
10 | 202030046173 |
11 | 7875376aa0a |
12 | 331a3553b91 |
13 | 16088a86527 |
14 | 9ac795c19b |
15 | 53c67be64d |
hex | 2f09eddbdd |
202030046173 has 8 divisors (see below), whose sum is σ = 210818460096. Its totient is φ = 193242007200.
The previous prime is 202030046159. The next prime is 202030046201. The reversal of 202030046173 is 371640030202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 202030046173 - 213 = 202030037981 is a prime.
It is a super-2 number, since 2×2020300461732 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202030046143) 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, 2089918 + ... + 2184448.
It is an arithmetic number, because the mean of its divisors is an integer number (26352307512).
Almost surely, 2202030046173 is an apocalyptic number.
202030046173 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
202030046173 is a deficient number, since it is larger than the sum of its proper divisors (8788413923).
202030046173 is an equidigital number, since it uses as much as digits as its factorization.
202030046173 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187475.
The product of its (nonzero) digits is 6048, while the sum is 28.
Adding to 202030046173 its reverse (371640030202), we get a palindrome (573670076375).
The spelling of 202030046173 in words is "two hundred two billion, thirty million, forty-six thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •