Base | Representation |
---|---|
bin | 100101100010101111011000… |
… | …0100001010111011100010101 |
3 | 1121022020200122022000100201102 |
4 | 1023011132300201113130111 |
5 | 321240442232134234331 |
6 | 3130201341422435445 |
7 | 126362224011124604 |
oct | 11305366041273425 |
9 | 1538220568010642 |
10 | 330230112024341 |
11 | 9624889317a301 |
12 | 31054984432b85 |
13 | 112357484bbbc9 |
14 | 5b7931914da3b |
15 | 282a09a4634cb |
hex | 12c57b0857715 |
330230112024341 has 8 divisors (see below), whose sum is σ = 339468654619584. Its totient is φ = 321118997603040.
The previous prime is 330230112024217. The next prime is 330230112024347. The reversal of 330230112024341 is 143420211032033.
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 330230112024341 - 218 = 330230111762197 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 (330230112024347) 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, 31857038231 + ... + 31857048596.
It is an arithmetic number, because the mean of its divisors is an integer number (42433581827448).
Almost surely, 2330230112024341 is an apocalyptic number.
It is an amenable number.
330230112024341 is a deficient number, since it is larger than the sum of its proper divisors (9238542595243).
330230112024341 is an equidigital number, since it uses as much as digits as its factorization.
330230112024341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63714086971.
The product of its (nonzero) digits is 10368, while the sum is 29.
Adding to 330230112024341 its reverse (143420211032033), we get a palindrome (473650323056374).
The spelling of 330230112024341 in words is "three hundred thirty trillion, two hundred thirty billion, one hundred twelve million, twenty-four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •