Base | Representation |
---|---|
bin | 110001011111000… |
… | …010111010101101 |
3 | 2010212012122110212 |
4 | 301133002322231 |
5 | 3200014100442 |
6 | 214214312205 |
7 | 26400525203 |
oct | 6137027255 |
9 | 2125178425 |
10 | 830221997 |
11 | 396703090 |
12 | 1b2058665 |
13 | 103004c27 |
14 | 7c395073 |
15 | 4cd46a82 |
hex | 317c2ead |
830221997 has 8 divisors (see below), whose sum is σ = 927787392. Its totient is φ = 736338400.
The previous prime is 830221969. The next prime is 830221999. The reversal of 830221997 is 799122038.
It is a happy number.
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 830221997 - 222 = 826027693 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (830221999) 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 7 ways as a sum of consecutive naturals, for example, 919973 + ... + 920874.
It is an arithmetic number, because the mean of its divisors is an integer number (115973424).
Almost surely, 2830221997 is an apocalyptic number.
It is an amenable number.
830221997 is a deficient number, since it is larger than the sum of its proper divisors (97565395).
830221997 is a wasteful number, since it uses less digits than its factorization.
830221997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1840899.
The product of its (nonzero) digits is 54432, while the sum is 41.
The square root of 830221997 is about 28813.5731383666. The cubic root of 830221997 is about 939.8634164763.
Adding to 830221997 its sum of digits (41), we get a palindrome (830222038).
The spelling of 830221997 in words is "eight hundred thirty million, two hundred twenty-one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •