Base | Representation |
---|---|
bin | 1000111101011000101111… |
… | …11011010100111111011101 |
3 | 2120202102210120202211021202 |
4 | 10132230113323110333131 |
5 | 10040242000100241242 |
6 | 105522412235405245 |
7 | 4102244315310506 |
oct | 436542773247735 |
9 | 76672716684252 |
10 | 19701416415197 |
11 | 6306361a51510 |
12 | 22623245b3825 |
13 | acbab2a6043a |
14 | 4c17a72a1bad |
15 | 24272bc10932 |
hex | 11eb17ed4fdd |
19701416415197 has 4 divisors (see below), whose sum is σ = 21492454271136. Its totient is φ = 17910378559260.
The previous prime is 19701416415181. The next prime is 19701416415203. The reversal of 19701416415197 is 79151461410791.
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 not a de Polignac number, because 19701416415197 - 24 = 19701416415181 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 (19701416417197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 895518927953 + ... + 895518927974.
It is an arithmetic number, because the mean of its divisors is an integer number (5373113567784).
Almost surely, 219701416415197 is an apocalyptic number.
It is an amenable number.
19701416415197 is a deficient number, since it is larger than the sum of its proper divisors (1791037855939).
19701416415197 is a wasteful number, since it uses less digits than its factorization.
19701416415197 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1791037855938.
The product of its (nonzero) digits is 1905120, while the sum is 56.
The spelling of 19701416415197 in words is "nineteen trillion, seven hundred one billion, four hundred sixteen million, four hundred fifteen thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •