Base | Representation |
---|---|
bin | 1000101101111011… |
… | …0100110000100001 |
3 | 20001002100002011012 |
4 | 2023132310300201 |
5 | 14243032112231 |
6 | 1024112430305 |
7 | 111663431111 |
oct | 21336646041 |
9 | 6032302135 |
10 | 2340113441 |
11 | aa0a29956 |
12 | 553848395 |
13 | 2b3a7b513 |
14 | 182b11041 |
15 | da696e2b |
hex | 8b7b4c21 |
2340113441 has 4 divisors (see below), whose sum is σ = 2344270512. Its totient is φ = 2335956372.
The previous prime is 2340113437. The next prime is 2340113453. The reversal of 2340113441 is 1443110432.
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 2340113441 - 22 = 2340113437 is a prime.
It is a super-2 number, since 2×23401134412 = 10952261833497720962, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2340113471) 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, 2077691 + ... + 2078816.
It is an arithmetic number, because the mean of its divisors is an integer number (586067628).
Almost surely, 22340113441 is an apocalyptic number.
It is an amenable number.
2340113441 is a deficient number, since it is larger than the sum of its proper divisors (4157071).
2340113441 is an equidigital number, since it uses as much as digits as its factorization.
2340113441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4157070.
The product of its (nonzero) digits is 1152, while the sum is 23.
The square root of 2340113441 is about 48374.7190276078. The cubic root of 2340113441 is about 1327.6358477476.
Adding to 2340113441 its reverse (1443110432), we get a palindrome (3783223873).
The spelling of 2340113441 in words is "two billion, three hundred forty million, one hundred thirteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •