Base | Representation |
---|---|
bin | 10111100001011000110… |
… | …11010010010011010001 |
3 | 2212021002210101100122211 |
4 | 23300230123102103101 |
5 | 101220142443431001 |
6 | 1415140453432121 |
7 | 112250633604022 |
oct | 13605433222321 |
9 | 2767083340584 |
10 | 808199202001 |
11 | 29183441a5a4 |
12 | 11077433b641 |
13 | 5b29c8577a9 |
14 | 2b18d284c49 |
15 | 1605303a351 |
hex | bc2c6d24d1 |
808199202001 has 9 divisors (see below), whose sum is σ = 809942515099. Its totient is φ = 806459638936.
The previous prime is 808199201987. The next prime is 808199202007. The reversal of 808199202001 is 100202991808.
The square root of 808199202001 is 898999.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 51431436225 + 756767765776 = 226785^2 + 869924^2 .
It is not a de Polignac number, because 808199202001 - 221 = 808197104849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (808199202007) 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 8 ways as a sum of consecutive naturals, for example, 694925646 + ... + 694926808.
Almost surely, 2808199202001 is an apocalyptic number.
808199202001 is the 898999-th square number.
808199202001 is the 449500-th centered octagonal number.
It is an amenable number.
808199202001 is a deficient number, since it is larger than the sum of its proper divisors (1743313098).
808199202001 is an frugal number, since it uses more digits than its factorization.
808199202001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3872 (or 1936 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 40.
The spelling of 808199202001 in words is "eight hundred eight billion, one hundred ninety-nine million, two hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •