Base | Representation |
---|---|
bin | 1010100001001011100101… |
… | …01101000011011011010101 |
3 | 10000220020102000000110211120 |
4 | 11100211302231003123111 |
5 | 11012431400231131401 |
6 | 121105531314154153 |
7 | 4605052655044041 |
oct | 520456255033325 |
9 | 100806360013746 |
10 | 23130323302101 |
11 | 7408573552564 |
12 | 271698a582959 |
13 | cba245984682 |
14 | 59d72953b021 |
15 | 2a1a15a01836 |
hex | 150972b436d5 |
23130323302101 has 8 divisors (see below), whose sum is σ = 31145781872544. Its totient is φ = 15267540133200.
The previous prime is 23130323302091. The next prime is 23130323302103. The reversal of 23130323302101 is 10120332303132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23130323302101 - 217 = 23130323171029 is a prime.
It is a super-2 number, since 2×231303233021012 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23130323302103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38168850031 + ... + 38168850636.
It is an arithmetic number, because the mean of its divisors is an integer number (3893222734068).
Almost surely, 223130323302101 is an apocalyptic number.
It is an amenable number.
23130323302101 is a deficient number, since it is larger than the sum of its proper divisors (8015458570443).
23130323302101 is a wasteful number, since it uses less digits than its factorization.
23130323302101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76337700771.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 23130323302101 its reverse (10120332303132), we get a palindrome (33250655605233).
The spelling of 23130323302101 in words is "twenty-three trillion, one hundred thirty billion, three hundred twenty-three million, three hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •