Base | Representation |
---|---|
bin | 10101100000110111… |
… | …111001010111100001 |
3 | 2012121212220202212112 |
4 | 111200313321113201 |
5 | 334302111231423 |
6 | 14340111205105 |
7 | 1445304425324 |
oct | 254067712741 |
9 | 65555822775 |
10 | 23100102113 |
11 | 9884450690 |
12 | 4588216795 |
13 | 2241a3a29a |
14 | 1191d087bb |
15 | 902ed4a78 |
hex | 560df95e1 |
23100102113 has 16 divisors (see below), whose sum is σ = 25376136192. Its totient is φ = 20853792000.
The previous prime is 23100102107. The next prime is 23100102119. The reversal of 23100102113 is 31120100132.
It is an interprime number because it is at equal distance from previous prime (23100102107) and next prime (23100102119).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23100102113 is a prime.
It is a super-2 number, since 2×231001021132 (a number of 22 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (23100102119) 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 15 ways as a sum of consecutive naturals, for example, 1236623 + ... + 1255163.
It is an arithmetic number, because the mean of its divisors is an integer number (1586008512).
Almost surely, 223100102113 is an apocalyptic number.
It is an amenable number.
23100102113 is a deficient number, since it is larger than the sum of its proper divisors (2276034079).
23100102113 is a wasteful number, since it uses less digits than its factorization.
23100102113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19336.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 23100102113 its reverse (31120100132), we get a palindrome (54220202245).
The spelling of 23100102113 in words is "twenty-three billion, one hundred million, one hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •