Base | Representation |
---|---|
bin | 1010100011001101111111… |
… | …00011100000000001000101 |
3 | 10001010221010000221220202221 |
4 | 11101212333203200001011 |
5 | 11020103240010321013 |
6 | 121202030242132341 |
7 | 4613111600141200 |
oct | 521467743400105 |
9 | 101127100856687 |
10 | 23200332120133 |
11 | 7435229717763 |
12 | 27284683510b1 |
13 | cc3a21b9889c |
14 | 5a2c8b3aa937 |
15 | 2a3761ca508d |
hex | 1519bf8e0045 |
23200332120133 has 12 divisors (see below), whose sum is σ = 26991150333312. Its totient is φ = 19883781885240.
The previous prime is 23200332120103. The next prime is 23200332120149. The reversal of 23200332120133 is 33102123300232.
It is not a de Polignac number, because 23200332120133 - 217 = 23200331989061 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23200332120098 and 23200332120107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23200332120103) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 25949685 + ... + 26828842.
It is an arithmetic number, because the mean of its divisors is an integer number (2249262527776).
Almost surely, 223200332120133 is an apocalyptic number.
It is an amenable number.
23200332120133 is a deficient number, since it is larger than the sum of its proper divisors (3790818213179).
23200332120133 is an equidigital number, since it uses as much as digits as its factorization.
23200332120133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52787512 (or 52787505 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 23200332120133 its reverse (33102123300232), we get a palindrome (56302455420365).
The spelling of 23200332120133 in words is "twenty-three trillion, two hundred billion, three hundred thirty-two million, one hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •