Base | Representation |
---|---|
bin | 10101100010000111… |
… | …100111101101010101 |
3 | 2012200100020120011112 |
4 | 111202013213231111 |
5 | 334322434020201 |
6 | 14342135144405 |
7 | 1445650161026 |
oct | 254207475525 |
9 | 65610216145 |
10 | 23121001301 |
11 | 9895225542 |
12 | 4593215105 |
13 | 2246176a78 |
14 | 11949c8c4d |
15 | 904c620bb |
hex | 5621e7b55 |
23121001301 has 8 divisors (see below), whose sum is σ = 23691780504. Its totient is φ = 22550548480.
The previous prime is 23121001279. The next prime is 23121001307. The reversal of 23121001301 is 10310012132.
It can be written as a sum of positive squares in 4 ways, for example, as 251698225 + 22869303076 = 15865^2 + 151226^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23121001301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23121001307) 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 7 ways as a sum of consecutive naturals, for example, 65045 + ... + 224661.
It is an arithmetic number, because the mean of its divisors is an integer number (2961472563).
Almost surely, 223121001301 is an apocalyptic number.
It is an amenable number.
23121001301 is a deficient number, since it is larger than the sum of its proper divisors (570779203).
23121001301 is a wasteful number, since it uses less digits than its factorization.
23121001301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163191.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 23121001301 its reverse (10310012132), we get a palindrome (33431013433).
The spelling of 23121001301 in words is "twenty-three billion, one hundred twenty-one million, one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •