Base | Representation |
---|---|
bin | 11101100101011111011… |
… | …110101111000001001001 |
3 | 21012100211201122111022111 |
4 | 131211133132233001021 |
5 | 231302313041022213 |
6 | 4154000400022321 |
7 | 266613433646542 |
oct | 35453736570111 |
9 | 7170751574274 |
10 | 2033121423433 |
11 | 714273049501 |
12 | 28a0483019a1 |
13 | 119951515789 |
14 | 705916ab4c9 |
15 | 37d45b82a3d |
hex | 1d95f7af049 |
2033121423433 has 8 divisors (see below), whose sum is σ = 2266017685920. Its totient is φ = 1812814148160.
The previous prime is 2033121423401. The next prime is 2033121423479. The reversal of 2033121423433 is 3343241213302.
It is a happy number.
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 2033121423433 - 25 = 2033121423401 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2033121423395 and 2033121423404.
It is not an unprimeable number, because it can be changed into a prime (2033121423233) 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, 3147246463 + ... + 3147247108.
It is an arithmetic number, because the mean of its divisors is an integer number (283252210740).
Almost surely, 22033121423433 is an apocalyptic number.
It is an amenable number.
2033121423433 is a deficient number, since it is larger than the sum of its proper divisors (232896262487).
2033121423433 is a wasteful number, since it uses less digits than its factorization.
2033121423433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6294493607.
The product of its (nonzero) digits is 31104, while the sum is 31.
Adding to 2033121423433 its reverse (3343241213302), we get a palindrome (5376362636735).
The spelling of 2033121423433 in words is "two trillion, thirty-three billion, one hundred twenty-one million, four hundred twenty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •