Base | Representation |
---|---|
bin | 10101100000111111… |
… | …001011111110000001 |
3 | 2012122000111212112201 |
4 | 111200333023332001 |
5 | 334303103411223 |
6 | 14340220153201 |
7 | 1445326605331 |
oct | 254077137601 |
9 | 65560455481 |
10 | 23102013313 |
11 | 9885536595 |
12 | 4588998801 |
13 | 2242259182 |
14 | 11922850c1 |
15 | 903260ead |
hex | 560fcbf81 |
23102013313 has 4 divisors (see below), whose sum is σ = 23149451200. Its totient is φ = 23054575428.
The previous prime is 23102013271. The next prime is 23102013331. The reversal of 23102013313 is 31331020132.
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 a de Polignac number, because none of the positive numbers 2k-23102013313 is a prime.
It is a super-2 number, since 2×231020133132 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23102013383) 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, 23718213 + ... + 23719186.
It is an arithmetic number, because the mean of its divisors is an integer number (5787362800).
Almost surely, 223102013313 is an apocalyptic number.
It is an amenable number.
23102013313 is a deficient number, since it is larger than the sum of its proper divisors (47437887).
23102013313 is an equidigital number, since it uses as much as digits as its factorization.
23102013313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47437886.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 23102013313 its reverse (31331020132), we get a palindrome (54433033445).
The spelling of 23102013313 in words is "twenty-three billion, one hundred two million, thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •