Base | Representation |
---|---|
bin | 10011001110101111… |
… | …01100101101111001 |
3 | 222122111210201100101 |
4 | 21213113230231321 |
5 | 132120443402223 |
6 | 4424243235401 |
7 | 513562153240 |
oct | 114727545571 |
9 | 28574721311 |
10 | 10324200313 |
11 | 4418818559 |
12 | 2001678b61 |
13 | c86c0c48b |
14 | 6dd235957 |
15 | 40659c4ad |
hex | 2675ecb79 |
10324200313 has 4 divisors (see below), whose sum is σ = 11799086080. Its totient is φ = 8849314548.
The previous prime is 10324200307. The next prime is 10324200329. The reversal of 10324200313 is 31300242301.
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, and also an emirpimes, since its reverse is a distinct semiprime: 31300242301 = 1759 ⋅17794339.
It is a cyclic number.
It is not a de Polignac number, because 10324200313 - 25 = 10324200281 is a prime.
It is a super-2 number, since 2×103242003132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10324201313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 737442873 + ... + 737442886.
It is an arithmetic number, because the mean of its divisors is an integer number (2949771520).
Almost surely, 210324200313 is an apocalyptic number.
It is an amenable number.
10324200313 is a deficient number, since it is larger than the sum of its proper divisors (1474885767).
10324200313 is an equidigital number, since it uses as much as digits as its factorization.
10324200313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1474885766.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 10324200313 its reverse (31300242301), we get a palindrome (41624442614).
The spelling of 10324200313 in words is "ten billion, three hundred twenty-four million, two hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •