Base | Representation |
---|---|
bin | 1000101110000101… |
… | …1100110111010101 |
3 | 20001010122001200120 |
4 | 2023201130313111 |
5 | 14243221131010 |
6 | 1024135302153 |
7 | 112002326433 |
oct | 21341346725 |
9 | 6033561616 |
10 | 2340802005 |
11 | aa135a213 |
12 | 553b1a959 |
13 | 2b3c5ca59 |
14 | 182c4dd53 |
15 | da780e70 |
hex | 8b85cdd5 |
2340802005 has 8 divisors (see below), whose sum is σ = 3745283232. Its totient is φ = 1248427728.
The previous prime is 2340802001. The next prime is 2340802007. The reversal of 2340802005 is 5002080432.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2340802005 - 22 = 2340802001 is a prime.
It is a super-2 number, since 2×23408020052 = 10958708053224040050, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2340802001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 78026719 + ... + 78026748.
It is an arithmetic number, because the mean of its divisors is an integer number (468160404).
Almost surely, 22340802005 is an apocalyptic number.
It is an amenable number.
2340802005 is a deficient number, since it is larger than the sum of its proper divisors (1404481227).
2340802005 is a wasteful number, since it uses less digits than its factorization.
2340802005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156053475.
The product of its (nonzero) digits is 1920, while the sum is 24.
The square root of 2340802005 is about 48381.8354860582. The cubic root of 2340802005 is about 1327.7660512079.
Adding to 2340802005 its reverse (5002080432), we get a palindrome (7342882437).
The spelling of 2340802005 in words is "two billion, three hundred forty million, eight hundred two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •