Base | Representation |
---|---|
bin | 1010100110110011000010… |
… | …01000011010000011111101 |
3 | 10001120200112000111121211100 |
4 | 11103121201020122003331 |
5 | 11024112110303324013 |
6 | 121334324345443313 |
7 | 4625024111025015 |
oct | 523314110320375 |
9 | 101520460447740 |
10 | 23323302011133 |
11 | 74823a1a47953 |
12 | 27482667a0539 |
13 | 10024bb4549b7 |
14 | 5a8bd4d1cc45 |
15 | 2a6a5c853473 |
hex | 15366121a0fd |
23323302011133 has 48 divisors (see below), whose sum is σ = 34225674496000. Its totient is φ = 15302563960320.
The previous prime is 23323302011129. The next prime is 23323302011159. The reversal of 23323302011133 is 33111020332332.
23323302011133 is a `hidden beast` number, since 2 + 3 + 323 + 3 + 0 + 201 + 1 + 133 = 666.
It is not a de Polignac number, because 23323302011133 - 22 = 23323302011129 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 23323302011097 and 23323302011106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23323302011333) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1157531343 + ... + 1157551491.
Almost surely, 223323302011133 is an apocalyptic number.
It is an amenable number.
23323302011133 is a deficient number, since it is larger than the sum of its proper divisors (10902372484867).
23323302011133 is a wasteful number, since it uses less digits than its factorization.
23323302011133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25402 (or 25399 counting only the distinct ones).
The product of its (nonzero) digits is 5832, while the sum is 27.
Adding to 23323302011133 its reverse (33111020332332), we get a palindrome (56434322343465).
The spelling of 23323302011133 in words is "twenty-three trillion, three hundred twenty-three billion, three hundred two million, eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •