Base | Representation |
---|---|
bin | 11110100101110000111… |
… | …010001100001101111101 |
3 | 21102221222021200120211121 |
4 | 132211300322030031331 |
5 | 233420132111412313 |
6 | 4245412352150541 |
7 | 304605552214150 |
oct | 36456072141575 |
9 | 7387867616747 |
10 | 2102133310333 |
11 | 7405674a6581 |
12 | 29b4a8238451 |
13 | 1232cc025604 |
14 | 73a5ad8bc97 |
15 | 39a3465e28d |
hex | 1e970e8c37d |
2102133310333 has 16 divisors (see below), whose sum is σ = 2435230224000. Its totient is φ = 1777331077632.
The previous prime is 2102133310289. The next prime is 2102133310367. The reversal of 2102133310333 is 3330133312012.
It is a cyclic number.
It is not a de Polignac number, because 2102133310333 - 233 = 2093543375741 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2102133310298 and 2102133310307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2102133310733) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3765468 + ... + 4287541.
It is an arithmetic number, because the mean of its divisors is an integer number (152201889000).
Almost surely, 22102133310333 is an apocalyptic number.
It is an amenable number.
2102133310333 is a deficient number, since it is larger than the sum of its proper divisors (333096913667).
2102133310333 is an equidigital number, since it uses as much as digits as its factorization.
2102133310333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8053524.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 2102133310333 its reverse (3330133312012), we get a palindrome (5432266622345).
The spelling of 2102133310333 in words is "two trillion, one hundred two billion, one hundred thirty-three million, three hundred ten thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •