Base | Representation |
---|---|
bin | 111011101011010… |
… | …0100001100100101 |
3 | 12011112212200002001 |
4 | 1313112210030211 |
5 | 13100103413013 |
6 | 530410245301 |
7 | 100423103632 |
oct | 16726441445 |
9 | 5145780061 |
10 | 2002404133 |
11 | 938339954 |
12 | 47a726831 |
13 | 25bb09722 |
14 | 14dd23189 |
15 | babd9ddd |
hex | 775a4325 |
2002404133 has 4 divisors (see below), whose sum is σ = 2026529568. Its totient is φ = 1978278700.
The previous prime is 2002404119. The next prime is 2002404163. The reversal of 2002404133 is 3314042002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2002404133 - 25 = 2002404101 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2002404133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002404163) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12062593 + ... + 12062758.
It is an arithmetic number, because the mean of its divisors is an integer number (506632392).
Almost surely, 22002404133 is an apocalyptic number.
It is an amenable number.
2002404133 is a deficient number, since it is larger than the sum of its proper divisors (24125435).
2002404133 is an equidigital number, since it uses as much as digits as its factorization.
2002404133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24125434.
The product of its (nonzero) digits is 576, while the sum is 19.
The square root of 2002404133 is about 44748.2305013282. The cubic root of 2002404133 is about 1260.4256840432.
Adding to 2002404133 its reverse (3314042002), we get a palindrome (5316446135).
The spelling of 2002404133 in words is "two billion, two million, four hundred four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •