Base | Representation |
---|---|
bin | 10010101001011100… |
… | …01000010010100001 |
3 | 221211201001102001222 |
4 | 21110232020102201 |
5 | 131000344011223 |
6 | 4333225104425 |
7 | 503042521241 |
oct | 112456102241 |
9 | 27751042058 |
10 | 10011313313 |
11 | 4278141961 |
12 | 1b34928115 |
13 | c3714ba41 |
14 | 6ad869b21 |
15 | 3d8d950c8 |
hex | 254b884a1 |
10011313313 has 4 divisors (see below), whose sum is σ = 10538224560. Its totient is φ = 9484402068.
The previous prime is 10011313307. The next prime is 10011313327. The reversal of 10011313313 is 31331311001.
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.
It is a cyclic number.
It is not a de Polignac number, because 10011313313 - 216 = 10011247777 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10011313291 and 10011313300.
It is not an unprimeable number, because it can be changed into a prime (10011313303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 263455595 + ... + 263455632.
It is an arithmetic number, because the mean of its divisors is an integer number (2634556140).
Almost surely, 210011313313 is an apocalyptic number.
It is an amenable number.
10011313313 is a deficient number, since it is larger than the sum of its proper divisors (526911247).
10011313313 is an equidigital number, since it uses as much as digits as its factorization.
10011313313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 526911246.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 10011313313 its reverse (31331311001), we get a palindrome (41342624314).
The spelling of 10011313313 in words is "ten billion, eleven million, three hundred thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •