Base | Representation |
---|---|
bin | 1000101001001001… |
… | …0000001100100101 |
3 | 12222200120021120212 |
4 | 2022102100030211 |
5 | 14222412300431 |
6 | 1022114305205 |
7 | 111331010114 |
oct | 21222201445 |
9 | 5880507525 |
10 | 2320040741 |
11 | a90669a47 |
12 | 548b88205 |
13 | 2ac870c95 |
14 | 1801a7c7b |
15 | d8a2e72b |
hex | 8a490325 |
2320040741 has 4 divisors (see below), whose sum is σ = 2320796352. Its totient is φ = 2319285132.
The previous prime is 2320040729. The next prime is 2320040761. The reversal of 2320040741 is 1470400232.
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 2320040741 - 210 = 2320039717 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2320040761) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 373181 + ... + 379346.
It is an arithmetic number, because the mean of its divisors is an integer number (580199088).
Almost surely, 22320040741 is an apocalyptic number.
It is an amenable number.
2320040741 is a deficient number, since it is larger than the sum of its proper divisors (755611).
2320040741 is an equidigital number, since it uses as much as digits as its factorization.
2320040741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 755610.
The product of its (nonzero) digits is 1344, while the sum is 23.
The square root of 2320040741 is about 48166.8012327993. The cubic root of 2320040741 is about 1323.8289386690.
Adding to 2320040741 its reverse (1470400232), we get a palindrome (3790440973).
The spelling of 2320040741 in words is "two billion, three hundred twenty million, forty thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •