Base | Representation |
---|---|
bin | 1011100101101010110… |
… | …1111001011110100101 |
3 | 201000212221212010110002 |
4 | 2321122231321132211 |
5 | 11230214130230330 |
6 | 231243315511045 |
7 | 20245435063232 |
oct | 2713255713645 |
9 | 630787763402 |
10 | 199090476965 |
11 | 77485425076 |
12 | 32702bb8485 |
13 | 15a0aa70073 |
14 | 98c93a6789 |
15 | 52a36b5e45 |
hex | 2e5ab797a5 |
199090476965 has 8 divisors (see below), whose sum is σ = 243991733760. Its totient is φ = 155883607312.
The previous prime is 199090476899. The next prime is 199090476967. The reversal of 199090476965 is 569674090991.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 199090476965 - 220 = 199089428389 is a prime.
It is a super-2 number, since 2×1990904769652 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (199090476967) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 423596525 + ... + 423596994.
It is an arithmetic number, because the mean of its divisors is an integer number (30498966720).
Almost surely, 2199090476965 is an apocalyptic number.
It is an amenable number.
199090476965 is a deficient number, since it is larger than the sum of its proper divisors (44901256795).
199090476965 is an equidigital number, since it uses as much as digits as its factorization.
199090476965 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 847193571.
The product of its (nonzero) digits is 33067440, while the sum is 65.
The spelling of 199090476965 in words is "one hundred ninety-nine billion, ninety million, four hundred seventy-six thousand, nine hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •