Base | Representation |
---|---|
bin | 10011000011101010… |
… | …11001110101101101 |
3 | 222102001001010000102 |
4 | 21201311121311231 |
5 | 131423204332023 |
6 | 4411124440445 |
7 | 511353550661 |
oct | 114165316555 |
9 | 28361033012 |
10 | 10231324013 |
11 | 4380352189 |
12 | 1b96549125 |
13 | c708c12a1 |
14 | 6d0b7a8a1 |
15 | 3ed353628 |
hex | 261d59d6d |
10231324013 has 4 divisors (see below), whose sum is σ = 10833166620. Its totient is φ = 9629481408.
The previous prime is 10231323923. The next prime is 10231324021. The reversal of 10231324013 is 31042313201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5297947369 + 4933376644 = 72787^2 + 70238^2 .
It is a cyclic number.
It is not a de Polignac number, because 10231324013 - 232 = 5936356717 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 (10231324093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 300921278 + ... + 300921311.
It is an arithmetic number, because the mean of its divisors is an integer number (2708291655).
Almost surely, 210231324013 is an apocalyptic number.
It is an amenable number.
10231324013 is a deficient number, since it is larger than the sum of its proper divisors (601842607).
10231324013 is an equidigital number, since it uses as much as digits as its factorization.
10231324013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 601842606.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 10231324013 its reverse (31042313201), we get a palindrome (41273637214).
The spelling of 10231324013 in words is "ten billion, two hundred thirty-one million, three hundred twenty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •