Base | Representation |
---|---|
bin | 1001100111001000000… |
… | …01111111110110010101 |
3 | 1011120102012220222100112 |
4 | 10303210001333312111 |
5 | 20402314232242123 |
6 | 411413414452405 |
7 | 32600510152556 |
oct | 4634401776625 |
9 | 1146365828315 |
10 | 330243243413 |
11 | 118067779746 |
12 | 54005964105 |
13 | 251ac70bc05 |
14 | 11dab9c832d |
15 | 88cc834d78 |
hex | 4ce407fd95 |
330243243413 has 2 divisors, whose sum is σ = 330243243414. Its totient is φ = 330243243412.
The previous prime is 330243243409. The next prime is 330243243419. The reversal of 330243243413 is 314342342033.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 185483539684 + 144759703729 = 430678^2 + 380473^2 .
It is a cyclic number.
It is not a de Polignac number, because 330243243413 - 22 = 330243243409 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 330243243413.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (330243243419) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165121621706 + 165121621707.
It is an arithmetic number, because the mean of its divisors is an integer number (165121621707).
Almost surely, 2330243243413 is an apocalyptic number.
It is an amenable number.
330243243413 is a deficient number, since it is larger than the sum of its proper divisors (1).
330243243413 is an equidigital number, since it uses as much as digits as its factorization.
330243243413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 62208, while the sum is 32.
Adding to 330243243413 its reverse (314342342033), we get a palindrome (644585585446).
The spelling of 330243243413 in words is "three hundred thirty billion, two hundred forty-three million, two hundred forty-three thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •