Base | Representation |
---|---|
bin | 1001100111000100101… |
… | …11011101011111010101 |
3 | 1011120100021101002100011 |
4 | 10303202113131133111 |
5 | 20402240110043123 |
6 | 411410540120221 |
7 | 32600020604044 |
oct | 4634227353725 |
9 | 1146307332304 |
10 | 330215315413 |
11 | 118052a33a55 |
12 | 53bb8536071 |
13 | 251a69b1079 |
14 | 11da7dd855b |
15 | 88ca169e0d |
hex | 4ce25dd7d5 |
330215315413 has 2 divisors, whose sum is σ = 330215315414. Its totient is φ = 330215315412.
The previous prime is 330215315411. The next prime is 330215315459. The reversal of 330215315413 is 314513512033.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 327850146724 + 2365168689 = 572582^2 + 48633^2 .
It is a cyclic number.
It is not a de Polignac number, because 330215315413 - 21 = 330215315411 is a prime.
Together with 330215315411, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (330215315411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165107657706 + 165107657707.
It is an arithmetic number, because the mean of its divisors is an integer number (165107657707).
Almost surely, 2330215315413 is an apocalyptic number.
It is an amenable number.
330215315413 is a deficient number, since it is larger than the sum of its proper divisors (1).
330215315413 is an equidigital number, since it uses as much as digits as its factorization.
330215315413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16200, while the sum is 31.
Adding to 330215315413 its reverse (314513512033), we get a palindrome (644728827446).
The spelling of 330215315413 in words is "three hundred thirty billion, two hundred fifteen million, three hundred fifteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •