Base | Representation |
---|---|
bin | 111011101011110… |
… | …0011110001010011 |
3 | 12011120100220021102 |
4 | 1313113203301103 |
5 | 13100140231111 |
6 | 530420015015 |
7 | 100425240050 |
oct | 16727436123 |
9 | 5146326242 |
10 | 2002664531 |
11 | 9384a755a |
12 | 47a83146b |
13 | 25bb9b0ca |
14 | 14dd90027 |
15 | bac3c13b |
hex | 775e3c53 |
2002664531 has 8 divisors (see below), whose sum is σ = 2289114624. Its totient is φ = 1716303240.
The previous prime is 2002664527. The next prime is 2002664539. The reversal of 2002664531 is 1354662002.
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 2002664531 - 22 = 2002664527 is a prime.
It is a super-2 number, since 2×20026645312 = 8021330447450899922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2002664494 and 2002664503.
It is not an unprimeable number, because it can be changed into a prime (2002664539) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36476 + ... + 73046.
It is an arithmetic number, because the mean of its divisors is an integer number (286139328).
Almost surely, 22002664531 is an apocalyptic number.
2002664531 is a deficient number, since it is larger than the sum of its proper divisors (286450093).
2002664531 is an equidigital number, since it uses as much as digits as its factorization.
2002664531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44401.
The product of its (nonzero) digits is 8640, while the sum is 29.
The square root of 2002664531 is about 44751.1399966526. The cubic root of 2002664531 is about 1260.4803180530.
The spelling of 2002664531 in words is "two billion, two million, six hundred sixty-four thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •