Base | Representation |
---|---|
bin | 110000111101011… |
… | …011110100010101 |
3 | 2010020122000012002 |
4 | 300331123310111 |
5 | 3140240123333 |
6 | 213301405045 |
7 | 26232610346 |
oct | 6075336425 |
9 | 2106560162 |
10 | 821411093 |
11 | 391735348 |
12 | 1ab109785 |
13 | 10123b689 |
14 | 7b1400cd |
15 | 4c1a60e8 |
hex | 30f5bd15 |
821411093 has 6 divisors (see below), whose sum is σ = 826538454. Its totient is φ = 816288264.
The previous prime is 821411081. The next prime is 821411099. The reversal of 821411093 is 390114128.
It can be written as a sum of positive squares in only one way, i.e., 802418929 + 18992164 = 28327^2 + 4358^2 .
It is a de Polignac number, because none of the positive numbers 2k-821411093 is a prime.
It is a super-3 number, since 3×8214110933 (a number of 28 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (821411099) 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 5 ways as a sum of consecutive naturals, for example, 375878 + ... + 378056.
It is an arithmetic number, because the mean of its divisors is an integer number (137756409).
Almost surely, 2821411093 is an apocalyptic number.
It is an amenable number.
821411093 is a deficient number, since it is larger than the sum of its proper divisors (5127361).
821411093 is an frugal number, since it uses more digits than its factorization.
821411093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4531 (or 2352 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 29.
The square root of 821411093 is about 28660.2702883277. The cubic root of 821411093 is about 936.5267526704.
The spelling of 821411093 in words is "eight hundred twenty-one million, four hundred eleven thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •