Base | Representation |
---|---|
bin | 1001100111011100011… |
… | …01111011011101111001 |
3 | 1011120212010111120222221 |
4 | 10303232031323131321 |
5 | 20403142010041403 |
6 | 411442401444041 |
7 | 32604653610250 |
oct | 4635615733571 |
9 | 1146763446887 |
10 | 330414143353 |
11 | 118145196368 |
12 | 54053040621 |
13 | 25208c47a38 |
14 | 11dc6593797 |
15 | 88dc841dbd |
hex | 4cee37b779 |
330414143353 has 4 divisors (see below), whose sum is σ = 377616163840. Its totient is φ = 283212122868.
The previous prime is 330414143341. The next prime is 330414143407. The reversal of 330414143353 is 353341414033.
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 330414143353 - 29 = 330414142841 is a prime.
It is a super-2 number, since 2×3304141433532 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (330414143333) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23601010233 + ... + 23601010246.
It is an arithmetic number, because the mean of its divisors is an integer number (94404040960).
Almost surely, 2330414143353 is an apocalyptic number.
It is an amenable number.
330414143353 is a deficient number, since it is larger than the sum of its proper divisors (47202020487).
330414143353 is an equidigital number, since it uses as much as digits as its factorization.
330414143353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47202020486.
The product of its (nonzero) digits is 77760, while the sum is 34.
Adding to 330414143353 its reverse (353341414033), we get a palindrome (683755557386).
The spelling of 330414143353 in words is "three hundred thirty billion, four hundred fourteen million, one hundred forty-three thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •