Base | Representation |
---|---|
bin | 100111100010… |
… | …010110100001 |
3 | 201111120011202 |
4 | 213202112201 |
5 | 10123124241 |
6 | 1010050545 |
7 | 154044452 |
oct | 47422641 |
9 | 21446152 |
10 | 10364321 |
11 | 5939960 |
12 | 3579a55 |
13 | 21bb646 |
14 | 153b129 |
15 | d9ad9b |
hex | 9e25a1 |
10364321 has 8 divisors (see below), whose sum is σ = 11462304. Its totient is φ = 9292320.
The previous prime is 10364287. The next prime is 10364357. The reversal of 10364321 is 12346301.
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 10364321 - 214 = 10347937 is a prime.
It is a super-3 number, since 3×103643213 (a number of 22 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10364293 and 10364302.
It is not an unprimeable number, because it can be changed into a prime (10364381) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5651 + ... + 7256.
It is an arithmetic number, because the mean of its divisors is an integer number (1432788).
Almost surely, 210364321 is an apocalyptic number.
10364321 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10364321 is a deficient number, since it is larger than the sum of its proper divisors (1097983).
10364321 is a wasteful number, since it uses less digits than its factorization.
10364321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12991.
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 10364321 is about 3219.3665526001. The cubic root of 10364321 is about 218.0286764734.
The spelling of 10364321 in words is "ten million, three hundred sixty-four thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •