Base | Representation |
---|---|
bin | 11100101010111001001… |
… | …100010000100101100101 |
3 | 20222100102202200122012111 |
4 | 130222321030100211211 |
5 | 224234433204121242 |
6 | 4105033122521021 |
7 | 262225304566255 |
oct | 34527114204545 |
9 | 6870382618174 |
10 | 1970202020197 |
11 | 69a61574a5a4 |
12 | 279a08806171 |
13 | 113a34cb2c68 |
14 | 6b5031d1965 |
15 | 363b1eab817 |
hex | 1cab9310965 |
1970202020197 has 8 divisors (see below), whose sum is σ = 1978421108312. Its totient is φ = 1961983296000.
The previous prime is 1970202020141. The next prime is 1970202020207. The reversal of 1970202020197 is 7910202020791.
It can be written as a sum of positive squares in 4 ways, for example, as 1228974005281 + 741228014916 = 1108591^2 + 860946^2 .
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 1970202020197 - 27 = 1970202020069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1970202023197) 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 7 ways as a sum of consecutive naturals, for example, 19688233 + ... + 19788049.
It is an arithmetic number, because the mean of its divisors is an integer number (247302638539).
Almost surely, 21970202020197 is an apocalyptic number.
It is an amenable number.
1970202020197 is a deficient number, since it is larger than the sum of its proper divisors (8219088115).
1970202020197 is an equidigital number, since it uses as much as digits as its factorization.
1970202020197 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181959.
The product of its (nonzero) digits is 31752, while the sum is 40.
The spelling of 1970202020197 in words is "one trillion, nine hundred seventy billion, two hundred two million, twenty thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •