Base | Representation |
---|---|
bin | 1111010001001110… |
… | …01011000000111101 |
3 | 210011022010200202012 |
4 | 13220213023000331 |
5 | 113242033101031 |
6 | 3433233541005 |
7 | 410100012044 |
oct | 75047130075 |
9 | 23138120665 |
10 | 8197550141 |
11 | 3527337830 |
12 | 1709414765 |
13 | a084502b1 |
14 | 57aa0d55b |
15 | 32ea1db2b |
hex | 1e89cb03d |
8197550141 has 4 divisors (see below), whose sum is σ = 8942781984. Its totient is φ = 7452318300.
The previous prime is 8197550117. The next prime is 8197550149. The reversal of 8197550141 is 1410557918.
It is a happy number.
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 a de Polignac number, because none of the positive numbers 2k-8197550141 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (8197550149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 372615905 + ... + 372615926.
It is an arithmetic number, because the mean of its divisors is an integer number (2235695496).
Almost surely, 28197550141 is an apocalyptic number.
It is an amenable number.
8197550141 is a deficient number, since it is larger than the sum of its proper divisors (745231843).
8197550141 is a wasteful number, since it uses less digits than its factorization.
8197550141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 745231842.
The product of its (nonzero) digits is 50400, while the sum is 41.
The square root of 8197550141 is about 90540.3232874723. The cubic root of 8197550141 is about 2016.3288335335.
The spelling of 8197550141 in words is "eight billion, one hundred ninety-seven million, five hundred fifty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •