Base | Representation |
---|---|
bin | 10011001000111… |
… | …110011100000001 |
3 | 211101020120211101 |
4 | 103020332130001 |
5 | 1124201320001 |
6 | 51510414401 |
7 | 10646321626 |
oct | 2310763401 |
9 | 741216741 |
10 | 321120001 |
11 | 15529a234 |
12 | 8b661401 |
13 | 516b3c47 |
14 | 3091034d |
15 | 1d2d1a01 |
hex | 1323e701 |
321120001 has 4 divisors (see below), whose sum is σ = 328587952. Its totient is φ = 313652052.
The previous prime is 321119993. The next prime is 321120013. The reversal of 321120001 is 100021123.
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 not a de Polignac number, because 321120001 - 23 = 321119993 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 321120001.
It is not an unprimeable number, because it can be changed into a prime (321120061) 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 3 ways as a sum of consecutive naturals, for example, 3733911 + ... + 3733996.
It is an arithmetic number, because the mean of its divisors is an integer number (82146988).
Almost surely, 2321120001 is an apocalyptic number.
It is an amenable number.
321120001 is a deficient number, since it is larger than the sum of its proper divisors (7467951).
321120001 is an equidigital number, since it uses as much as digits as its factorization.
321120001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7467950.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 321120001 is about 17919.8214555838. The cubic root of 321120001 is about 684.7874389758.
Adding to 321120001 its reverse (100021123), we get a palindrome (421141124).
The spelling of 321120001 in words is "three hundred twenty-one million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •