Base | Representation |
---|---|
bin | 10011001100011… |
… | …100101000101001 |
3 | 211102221211021112 |
4 | 103030130220221 |
5 | 1124414430441 |
6 | 51542120105 |
7 | 10660132220 |
oct | 2314345051 |
9 | 742854245 |
10 | 322030121 |
11 | 155860aa6 |
12 | 8ba20035 |
13 | 5194228a |
14 | 30aa9cb7 |
15 | 1d4114eb |
hex | 1331ca29 |
322030121 has 8 divisors (see below), whose sum is σ = 368294784. Its totient is φ = 275830560.
The previous prime is 322030103. The next prime is 322030151. The reversal of 322030121 is 121030223.
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 a de Polignac number, because none of the positive numbers 2k-322030121 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 322030096 and 322030105.
It is not an unprimeable number, because it can be changed into a prime (322030151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5165 + ... + 25898.
It is an arithmetic number, because the mean of its divisors is an integer number (46036848).
Almost surely, 2322030121 is an apocalyptic number.
It is an amenable number.
322030121 is a deficient number, since it is larger than the sum of its proper divisors (46264663).
322030121 is a wasteful number, since it uses less digits than its factorization.
322030121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32551.
The product of its (nonzero) digits is 72, while the sum is 14.
The square root of 322030121 is about 17945.1977141518. The cubic root of 322030121 is about 685.4337714702.
Adding to 322030121 its reverse (121030223), we get a palindrome (443060344).
The spelling of 322030121 in words is "three hundred twenty-two million, thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •