Base | Representation |
---|---|
bin | 100001110001110010010… |
… | …111100111011001001101 |
3 | 22012220102111110000212021 |
4 | 201301302113213121031 |
5 | 301012304442230013 |
6 | 4534202312010141 |
7 | 326462346042241 |
oct | 41616227473115 |
9 | 8186374400767 |
10 | 2321201133133 |
11 | 815463587213 |
12 | 315a45690951 |
13 | 13ab7186aa6c |
14 | 804bd620421 |
15 | 405a6ab8a8d |
hex | 21c725e764d |
2321201133133 has 8 divisors (see below), whose sum is σ = 2384879031360. Its totient is φ = 2258334418560.
The previous prime is 2321201133127. The next prime is 2321201133187. The reversal of 2321201133133 is 3313311021232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2321201133133 - 213 = 2321201124941 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2321201133098 and 2321201133107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2321201133233) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 202790113 + ... + 202801558.
It is an arithmetic number, because the mean of its divisors is an integer number (298109878920).
Almost surely, 22321201133133 is an apocalyptic number.
It is an amenable number.
2321201133133 is a deficient number, since it is larger than the sum of its proper divisors (63677898227).
2321201133133 is an equidigital number, since it uses as much as digits as its factorization.
2321201133133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 405591827.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 2321201133133 its reverse (3313311021232), we get a palindrome (5634512154365).
The spelling of 2321201133133 in words is "two trillion, three hundred twenty-one billion, two hundred one million, one hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •