Base | Representation |
---|---|
bin | 10011001110101110… |
… | …00001001111000101 |
3 | 222122111110200001002 |
4 | 21213113001033011 |
5 | 132120422202323 |
6 | 4424235343045 |
7 | 513560512061 |
oct | 114727011705 |
9 | 28574420032 |
10 | 10324022213 |
11 | 441870676a |
12 | 20015b1a85 |
13 | c86b793ab |
14 | 6dd1caaa1 |
15 | 406564828 |
hex | 2675c13c5 |
10324022213 has 8 divisors (see below), whose sum is σ = 10776628800. Its totient is φ = 9871727008.
The previous prime is 10324022207. The next prime is 10324022237. The reversal of 10324022213 is 31222042301.
10324022213 is digitally balanced in base 2 and base 3, because in such bases 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 10324022213 - 24 = 10324022197 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10324012213) 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, 8768 + ... + 143961.
It is an arithmetic number, because the mean of its divisors is an integer number (1347078600).
Almost surely, 210324022213 is an apocalyptic number.
It is an amenable number.
10324022213 is a deficient number, since it is larger than the sum of its proper divisors (452606587).
10324022213 is a wasteful number, since it uses less digits than its factorization.
10324022213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155691.
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 10324022213 its reverse (31222042301), we get a palindrome (41546064514).
The spelling of 10324022213 in words is "ten billion, three hundred twenty-four million, twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •