Base | Representation |
---|---|
bin | 1000101110101101… |
… | …1100011100001101 |
3 | 20001022120011020122 |
4 | 2023223130130031 |
5 | 14244403443314 |
6 | 1024311354325 |
7 | 112033520156 |
oct | 21353343415 |
9 | 6038504218 |
10 | 2343421709 |
11 | aa2889462 |
12 | 5549829a5 |
13 | 2b4669285 |
14 | 18333292d |
15 | daaec28e |
hex | 8badc70d |
2343421709 has 8 divisors (see below), whose sum is σ = 2370704760. Its totient is φ = 2316160000.
The previous prime is 2343421687. The next prime is 2343421727. The reversal of 2343421709 is 9071243432.
It can be written as a sum of positive squares in 4 ways, for example, as 94575625 + 2248846084 = 9725^2 + 47422^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2343421709 - 212 = 2343417613 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 (2343421799) 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 7 ways as a sum of consecutive naturals, for example, 352799 + ... + 359379.
It is an arithmetic number, because the mean of its divisors is an integer number (296338095).
Almost surely, 22343421709 is an apocalyptic number.
It is an amenable number.
2343421709 is a deficient number, since it is larger than the sum of its proper divisors (27283051).
2343421709 is an equidigital number, since it uses as much as digits as its factorization.
2343421709 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10671.
The product of its (nonzero) digits is 36288, while the sum is 35.
The square root of 2343421709 is about 48408.9011339857. The cubic root of 2343421709 is about 1328.2611888055.
The spelling of 2343421709 in words is "two billion, three hundred forty-three million, four hundred twenty-one thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •