Base | Representation |
---|---|
bin | 1001101000011001100… |
… | …10001000000000000001 |
3 | 1011122011212102210012201 |
4 | 10310030302020000001 |
5 | 20410214244321403 |
6 | 412005320553201 |
7 | 32623451435461 |
oct | 4641462100001 |
9 | 1148155383181 |
10 | 330926948353 |
11 | 1183886a9351 |
12 | 54176922801 |
13 | 2528b264351 |
14 | 1203471dba1 |
15 | 891c88921d |
hex | 4d0cc88001 |
330926948353 has 2 divisors, whose sum is σ = 330926948354. Its totient is φ = 330926948352.
The previous prime is 330926948323. The next prime is 330926948369. The reversal of 330926948353 is 353849629033.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 328715315569 + 2211632784 = 573337^2 + 47028^2 .
It is an emirp because it is prime and its reverse (353849629033) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 330926948353 - 225 = 330893393921 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 330926948294 and 330926948303.
It is not a weakly prime, because it can be changed into another prime (330926948323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165463474176 + 165463474177.
It is an arithmetic number, because the mean of its divisors is an integer number (165463474177).
Almost surely, 2330926948353 is an apocalyptic number.
It is an amenable number.
330926948353 is a deficient number, since it is larger than the sum of its proper divisors (1).
330926948353 is an equidigital number, since it uses as much as digits as its factorization.
330926948353 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12597120, while the sum is 55.
The spelling of 330926948353 in words is "three hundred thirty billion, nine hundred twenty-six million, nine hundred forty-eight thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •