Base | Representation |
---|---|
bin | 10101100010001000… |
… | …110011110101101101 |
3 | 2012200100211101220212 |
4 | 111202020303311231 |
5 | 334323024010013 |
6 | 14342145552205 |
7 | 1445652630122 |
oct | 254210636555 |
9 | 65610741825 |
10 | 23121313133 |
11 | 9895418856 |
12 | 4593345665 |
13 | 2246255999 |
14 | 1194a6a749 |
15 | 904cc46a8 |
hex | 562233d6d |
23121313133 has 8 divisors (see below), whose sum is σ = 23306532408. Its totient is φ = 22936332544.
The previous prime is 23121313049. The next prime is 23121313211. The reversal of 23121313133 is 33131312132.
It can be written as a sum of positive squares in 4 ways, for example, as 5592347524 + 17528965609 = 74782^2 + 132397^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23121313133 - 212 = 23121309037 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23121313099 and 23121313108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23121313333) 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, 137435 + ... + 255207.
It is an arithmetic number, because the mean of its divisors is an integer number (2913316551).
Almost surely, 223121313133 is an apocalyptic number.
It is an amenable number.
23121313133 is a deficient number, since it is larger than the sum of its proper divisors (185219275).
23121313133 is a wasteful number, since it uses less digits than its factorization.
23121313133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 119343.
The product of its digits is 972, while the sum is 23.
Adding to 23121313133 its reverse (33131312132), we get a palindrome (56252625265).
The spelling of 23121313133 in words is "twenty-three billion, one hundred twenty-one million, three hundred thirteen thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •