Base | Representation |
---|---|
bin | 10011001101100011… |
… | …00011110011010001 |
3 | 222121210222202200101 |
4 | 21212301203303101 |
5 | 132110413433241 |
6 | 4423245052401 |
7 | 513411162463 |
oct | 114661436321 |
9 | 28553882611 |
10 | 10314202321 |
11 | 4413109955 |
12 | 1bba257101 |
13 | c84b1b7c7 |
14 | 6dbb92133 |
15 | 405774e31 |
hex | 266c63cd1 |
10314202321 has 8 divisors (see below), whose sum is σ = 10682254080. Its totient is φ = 9946976592.
The previous prime is 10314202303. The next prime is 10314202333. The reversal of 10314202321 is 12320241301.
It is a happy number.
10314202321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10314202321 - 29 = 10314201809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10314802321) 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, 181035 + ... + 231088.
It is an arithmetic number, because the mean of its divisors is an integer number (1335281760).
Almost surely, 210314202321 is an apocalyptic number.
It is an amenable number.
10314202321 is a deficient number, since it is larger than the sum of its proper divisors (368051759).
10314202321 is an equidigital number, since it uses as much as digits as its factorization.
10314202321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 413015.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 10314202321 its reverse (12320241301), we get a palindrome (22634443622).
The spelling of 10314202321 in words is "ten billion, three hundred fourteen million, two hundred two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •