Base | Representation |
---|---|
bin | 1010100000111011010101… |
… | …10010101000011100100101 |
3 | 10000212101220002201220200011 |
4 | 11100131222302220130211 |
5 | 11012311014224042013 |
6 | 121101530000450221 |
7 | 4604323550311042 |
oct | 520355262503445 |
9 | 100771802656604 |
10 | 23121600612133 |
11 | 74048a7848481 |
12 | 2715155319971 |
13 | cb94857b956a |
14 | 59d13ccb01c9 |
15 | 2a16a4d50c3d |
hex | 15076aca8725 |
23121600612133 has 32 divisors (see below), whose sum is σ = 25179268262400. Its totient is φ = 21164387403456.
The previous prime is 23121600612109. The next prime is 23121600612139. The reversal of 23121600612133 is 33121600612132.
It is a cyclic number.
It is not a de Polignac number, because 23121600612133 - 241 = 20922577356581 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23121600612095 and 23121600612104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23121600612139) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 13899435 + ... + 15473767.
It is an arithmetic number, because the mean of its divisors is an integer number (786852133200).
Almost surely, 223121600612133 is an apocalyptic number.
It is an amenable number.
23121600612133 is a deficient number, since it is larger than the sum of its proper divisors (2057667650267).
23121600612133 is a wasteful number, since it uses less digits than its factorization.
23121600612133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1574641.
The product of its (nonzero) digits is 7776, while the sum is 31.
Subtracting 23121600612133 from its reverse (33121600612132), we obtain a palindrome (9999999999999).
The spelling of 23121600612133 in words is "twenty-three trillion, one hundred twenty-one billion, six hundred million, six hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •