Base | Representation |
---|---|
bin | 111011101010111… |
… | …1100010101100101 |
3 | 12011112120101010020 |
4 | 1313111330111211 |
5 | 13100033201434 |
6 | 530402545353 |
7 | 100421523636 |
oct | 16725742545 |
9 | 5145511106 |
10 | 2002240869 |
11 | 938238222 |
12 | 47a668259 |
13 | 25ba80315 |
14 | 14dcbd88d |
15 | baba6849 |
hex | 7757c565 |
2002240869 has 4 divisors (see below), whose sum is σ = 2669654496. Its totient is φ = 1334827244.
The previous prime is 2002240853. The next prime is 2002240871. The reversal of 2002240869 is 9680422002.
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 2002240869 - 24 = 2002240853 is a prime.
It is a super-2 number, since 2×20022408692 = 8017936994987750322, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002240169) 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 3 ways as a sum of consecutive naturals, for example, 333706809 + ... + 333706814.
It is an arithmetic number, because the mean of its divisors is an integer number (667413624).
Almost surely, 22002240869 is an apocalyptic number.
It is an amenable number.
2002240869 is a deficient number, since it is larger than the sum of its proper divisors (667413627).
2002240869 is an equidigital number, since it uses as much as digits as its factorization.
2002240869 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 667413626.
The product of its (nonzero) digits is 13824, while the sum is 33.
The square root of 2002240869 is about 44746.4062132368. The cubic root of 2002240869 is about 1260.3914272668.
The spelling of 2002240869 in words is "two billion, two million, two hundred forty thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •