Base | Representation |
---|---|
bin | 11101101101111000101… |
… | …000101101011001010101 |
3 | 21020020002210021111111200 |
4 | 131231320220231121111 |
5 | 231424242122400341 |
6 | 4202050530023113 |
7 | 300352653344232 |
oct | 35557050553125 |
9 | 7206083244450 |
10 | 2042133403221 |
11 | 71807808228a |
12 | 28b942417a99 |
13 | 11a7595cb7b2 |
14 | 70ba8520789 |
15 | 381c1e28db6 |
hex | 1db78a2d655 |
2042133403221 has 12 divisors (see below), whose sum is σ = 2949915291648. Its totient is φ = 1361345172264.
The previous prime is 2042133403187. The next prime is 2042133403231. The reversal of 2042133403221 is 1223043312402.
2042133403221 is a `hidden beast` number, since 2 + 0 + 4 + 2 + 1 + 33 + 403 + 221 = 666.
It is not a de Polignac number, because 2042133403221 - 26 = 2042133403157 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2042133403231) 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 11 ways as a sum of consecutive naturals, for example, 6256725 + ... + 6575018.
It is an arithmetic number, because the mean of its divisors is an integer number (245826274304).
Almost surely, 22042133403221 is an apocalyptic number.
It is an amenable number.
2042133403221 is a deficient number, since it is larger than the sum of its proper divisors (907781888427).
2042133403221 is a wasteful number, since it uses less digits than its factorization.
2042133403221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12849432 (or 12849429 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 2042133403221 its reverse (1223043312402), we get a palindrome (3265176715623).
The spelling of 2042133403221 in words is "two trillion, forty-two billion, one hundred thirty-three million, four hundred three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •