Base | Representation |
---|---|
bin | 100010000110011111010… |
… | …100001010101100001011 |
3 | 22022000210200001111222110 |
4 | 202012133110022230023 |
5 | 301343321042242311 |
6 | 4552320142353403 |
7 | 331210244452662 |
oct | 42063724125413 |
9 | 8260720044873 |
10 | 2343430040331 |
11 | 82393018a1a6 |
12 | 31a209b8b863 |
13 | 13cca4c587a3 |
14 | 815cb949dd9 |
15 | 40e583618a6 |
hex | 2219f50ab0b |
2343430040331 has 8 divisors (see below), whose sum is σ = 3127260041280. Its totient is φ = 1560943366472.
The previous prime is 2343430040323. The next prime is 2343430040437. The reversal of 2343430040331 is 1330400343432.
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 2343430040331 - 23 = 2343430040323 is a prime.
It is a super-2 number, since 2×23434300403312 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2343430040321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 335827701 + ... + 335834678.
It is an arithmetic number, because the mean of its divisors is an integer number (390907505160).
Almost surely, 22343430040331 is an apocalyptic number.
2343430040331 is a deficient number, since it is larger than the sum of its proper divisors (783830000949).
2343430040331 is a wasteful number, since it uses less digits than its factorization.
2343430040331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 671663545.
The product of its (nonzero) digits is 31104, while the sum is 30.
Adding to 2343430040331 its reverse (1330400343432), we get a palindrome (3673830383763).
The spelling of 2343430040331 in words is "two trillion, three hundred forty-three billion, four hundred thirty million, forty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •