Base | Representation |
---|---|
bin | 1000101111010000… |
… | …0000001011011001 |
3 | 20001110210010210102 |
4 | 2023310000023121 |
5 | 14300442241431 |
6 | 1024431425145 |
7 | 112061553113 |
oct | 21364001331 |
9 | 6043703712 |
10 | 2345665241 |
11 | aa4081017 |
12 | 5556851b5 |
13 | 2b4c734ca |
14 | 1837583b3 |
15 | dade1dcb |
hex | 8bd002d9 |
2345665241 has 4 divisors (see below), whose sum is σ = 2373926352. Its totient is φ = 2317404132.
The previous prime is 2345665211. The next prime is 2345665277. The reversal of 2345665241 is 1425665432.
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 2345665241 - 218 = 2345403097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2345665195 and 2345665204.
It is not an unprimeable number, because it can be changed into a prime (2345665211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14130431 + ... + 14130596.
It is an arithmetic number, because the mean of its divisors is an integer number (593481588).
Almost surely, 22345665241 is an apocalyptic number.
It is an amenable number.
2345665241 is a deficient number, since it is larger than the sum of its proper divisors (28261111).
2345665241 is an equidigital number, since it uses as much as digits as its factorization.
2345665241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28261110.
The product of its digits is 172800, while the sum is 38.
The square root of 2345665241 is about 48432.0683122247. The cubic root of 2345665241 is about 1328.6849347017.
The spelling of 2345665241 in words is "two billion, three hundred forty-five million, six hundred sixty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •