Base | Representation |
---|---|
bin | 110100111110100110011101… |
… | …010111110010110101000001 |
3 | 1010112222121112222210201102202 |
4 | 310332212131113302311001 |
5 | 221014434124200213441 |
6 | 2143314511514322545 |
7 | 100035501110414030 |
oct | 6476463527626501 |
9 | 1115877488721382 |
10 | 233000321101121 |
11 | 68271976a57102 |
12 | 22171034129455 |
13 | a001ab3906492 |
14 | 41773c07b0717 |
15 | 1be0d1688819b |
hex | d3e99d5f2d41 |
233000321101121 has 32 divisors (see below), whose sum is σ = 280638246205440. Its totient is φ = 189126105860736.
The previous prime is 233000321101111. The next prime is 233000321101153. The reversal of 233000321101121 is 121101123000332.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 233000321101121 - 226 = 233000253992257 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 233000321101093 and 233000321101102.
It is not an unprimeable number, because it can be changed into a prime (233000321101111) 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, 22918565 + ... + 31484301.
It is an arithmetic number, because the mean of its divisors is an integer number (8769945193920).
Almost surely, 2233000321101121 is an apocalyptic number.
It is an amenable number.
233000321101121 is a deficient number, since it is larger than the sum of its proper divisors (47637925104319).
233000321101121 is a wasteful number, since it uses less digits than its factorization.
233000321101121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8567453.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 233000321101121 its reverse (121101123000332), we get a palindrome (354101444101453).
The spelling of 233000321101121 in words is "two hundred thirty-three trillion, three hundred twenty-one million, one hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •