Base | Representation |
---|---|
bin | 100011010111011001011… |
… | …100110010000011000101 |
3 | 22121100001010002122220021 |
4 | 203113121130302003011 |
5 | 304304231002120031 |
6 | 5100244440335141 |
7 | 340404134205421 |
oct | 43273134620305 |
9 | 8540033078807 |
10 | 2430304723141 |
11 | 857760727219 |
12 | 3330141744b1 |
13 | 14823b42a349 |
14 | 858ad73db81 |
15 | 43340143511 |
hex | 235d97320c5 |
2430304723141 has 8 divisors (see below), whose sum is σ = 2513117137824. Its totient is φ = 2348861108880.
The previous prime is 2430304723129. The next prime is 2430304723159. The reversal of 2430304723141 is 1413274030342.
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 2430304723141 - 25 = 2430304723109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2430304723097 and 2430304723106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2430304720141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 342196495 + ... + 342203596.
It is an arithmetic number, because the mean of its divisors is an integer number (314139642228).
Almost surely, 22430304723141 is an apocalyptic number.
It is an amenable number.
2430304723141 is a deficient number, since it is larger than the sum of its proper divisors (82812414683).
2430304723141 is an equidigital number, since it uses as much as digits as its factorization.
2430304723141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 684400211.
The product of its (nonzero) digits is 48384, while the sum is 34.
Adding to 2430304723141 its reverse (1413274030342), we get a palindrome (3843578753483).
The spelling of 2430304723141 in words is "two trillion, four hundred thirty billion, three hundred four million, seven hundred twenty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •