Base | Representation |
---|---|
bin | 1000101110000001… |
… | …0011101101111011 |
3 | 20001010001211200220 |
4 | 2023200103231323 |
5 | 14243132034040 |
6 | 1024125031123 |
7 | 111666641100 |
oct | 21340235573 |
9 | 6033054626 |
10 | 2340502395 |
11 | aa1175100 |
12 | 5539b54a3 |
13 | 2b3b8657a |
14 | 182bb2aa7 |
15 | da7222d0 |
hex | 8b813b7b |
2340502395 has 72 divisors (see below), whose sum is σ = 4788402192. Its totient is φ = 972639360.
The previous prime is 2340502369. The next prime is 2340502397. The reversal of 2340502395 is 5932050432.
It is not a de Polignac number, because 2340502395 - 214 = 2340486011 is a prime.
It is a super-2 number, since 2×23405023952 = 10955902922001472050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (2340502397) 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 71 ways as a sum of consecutive naturals, for example, 75777 + ... + 102093.
It is an arithmetic number, because the mean of its divisors is an integer number (66505586).
Almost surely, 22340502395 is an apocalyptic number.
2340502395 is an abundant number, since it is smaller than the sum of its proper divisors (2447899797).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2340502395 is a wasteful number, since it uses less digits than its factorization.
2340502395 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26361 (or 26343 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 33.
The square root of 2340502395 is about 48378.7390803026. The cubic root of 2340502395 is about 1327.7093998324.
The spelling of 2340502395 in words is "two billion, three hundred forty million, five hundred two thousand, three hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •