Base | Representation |
---|---|
bin | 1011110000100010011… |
… | …0110111010100011001 |
3 | 201022102021102222112201 |
4 | 2330020212313110121 |
5 | 11302203003244242 |
6 | 232445013410201 |
7 | 20410641360415 |
oct | 2741046672431 |
9 | 638367388481 |
10 | 202007868697 |
11 | 787421a2718 |
12 | 33198039961 |
13 | 160842bcc6b |
14 | 9ac4a27d45 |
15 | 53c488d4b7 |
hex | 2f089b7519 |
202007868697 has 4 divisors (see below), whose sum is σ = 202023242496. Its totient is φ = 201992494900.
The previous prime is 202007868613. The next prime is 202007868707. The reversal of 202007868697 is 796868700202.
202007868697 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 202007868697 - 215 = 202007835929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (202007868497) 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, 7667173 + ... + 7693474.
It is an arithmetic number, because the mean of its divisors is an integer number (50505810624).
Almost surely, 2202007868697 is an apocalyptic number.
It is an amenable number.
202007868697 is a deficient number, since it is larger than the sum of its proper divisors (15373799).
202007868697 is a wasteful number, since it uses less digits than its factorization.
202007868697 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15373798.
The product of its (nonzero) digits is 4064256, while the sum is 55.
The spelling of 202007868697 in words is "two hundred two billion, seven million, eight hundred sixty-eight thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •