Base | Representation |
---|---|
bin | 110000111111010… |
… | …111110110100101 |
3 | 2010021120211002200 |
4 | 300333113312211 |
5 | 3140402403031 |
6 | 213320325113 |
7 | 26240124501 |
oct | 6077276645 |
9 | 2107524080 |
10 | 821919141 |
11 | 391a5201a |
12 | 1ab313799 |
13 | 1013889b4 |
14 | 7b233301 |
15 | 4c2568e6 |
hex | 30fd7da5 |
821919141 has 6 divisors (see below), whose sum is σ = 1187216550. Its totient is φ = 547946088.
The previous prime is 821919101. The next prime is 821919167. The reversal of 821919141 is 141919128.
It can be written as a sum of positive squares in only one way, i.e., 598536225 + 223382916 = 24465^2 + 14946^2 .
It is not a de Polignac number, because 821919141 - 27 = 821919013 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 821919096 and 821919105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (821919101) 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 5 ways as a sum of consecutive naturals, for example, 45662166 + ... + 45662183.
It is an arithmetic number, because the mean of its divisors is an integer number (197869425).
Almost surely, 2821919141 is an apocalyptic number.
It is an amenable number.
821919141 is a deficient number, since it is larger than the sum of its proper divisors (365297409).
821919141 is a wasteful number, since it uses less digits than its factorization.
821919141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91324355 (or 91324352 counting only the distinct ones).
The product of its digits is 5184, while the sum is 36.
The square root of 821919141 is about 28669.1321982372. The cubic root of 821919141 is about 936.7197954664.
The spelling of 821919141 in words is "eight hundred twenty-one million, nine hundred nineteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •