Base | Representation |
---|---|
bin | 1000101110000010… |
… | …0001111001110001 |
3 | 20001010011210101211 |
4 | 2023200201321301 |
5 | 14243140413442 |
6 | 1024130200121 |
7 | 112000302352 |
oct | 21340417161 |
9 | 6033153354 |
10 | 2340560497 |
11 | aa1204820 |
12 | 553a23041 |
13 | 2b3ba6b52 |
14 | 182bc9d29 |
15 | da734617 |
hex | 8b821e71 |
2340560497 has 4 divisors (see below), whose sum is σ = 2553338736. Its totient is φ = 2127782260.
The previous prime is 2340560441. The next prime is 2340560539. The reversal of 2340560497 is 7940650432.
It is a happy number.
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 2340560497 - 215 = 2340527729 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2340560407) 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, 106389103 + ... + 106389124.
It is an arithmetic number, because the mean of its divisors is an integer number (638334684).
Almost surely, 22340560497 is an apocalyptic number.
It is an amenable number.
2340560497 is a deficient number, since it is larger than the sum of its proper divisors (212778239).
2340560497 is a wasteful number, since it uses less digits than its factorization.
2340560497 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 212778238.
The product of its (nonzero) digits is 181440, while the sum is 40.
The square root of 2340560497 is about 48379.3395676295. The cubic root of 2340560497 is about 1327.7203863529.
The spelling of 2340560497 in words is "two billion, three hundred forty million, five hundred sixty thousand, four hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •