Base | Representation |
---|---|
bin | 1001010100101010010… |
… | …10100001011000001001 |
3 | 1010121211100200022101022 |
4 | 10222111022201120021 |
5 | 20222014004040431 |
6 | 403054014402225 |
7 | 32100036202103 |
oct | 4522512413011 |
9 | 1117740608338 |
10 | 320330143241 |
11 | 113940018879 |
12 | 520b9b00375 |
13 | 2428ca29574 |
14 | 1170b206573 |
15 | 84ec3e007b |
hex | 4a952a1609 |
320330143241 has 2 divisors, whose sum is σ = 320330143242. Its totient is φ = 320330143240.
The previous prime is 320330143163. The next prime is 320330143247. The reversal of 320330143241 is 142341033023.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 297941305600 + 22388837641 = 545840^2 + 149629^2 .
It is a cyclic number.
It is not a de Polignac number, because 320330143241 - 218 = 320329881097 is a prime.
It is a super-2 number, since 2×3203301432412 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 320330143241.
It is not a weakly prime, because it can be changed into another prime (320330143247) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160165071620 + 160165071621.
It is an arithmetic number, because the mean of its divisors is an integer number (160165071621).
Almost surely, 2320330143241 is an apocalyptic number.
It is an amenable number.
320330143241 is a deficient number, since it is larger than the sum of its proper divisors (1).
320330143241 is an equidigital number, since it uses as much as digits as its factorization.
320330143241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 320330143241 its reverse (142341033023), we get a palindrome (462671176264).
The spelling of 320330143241 in words is "three hundred twenty billion, three hundred thirty million, one hundred forty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.518 sec. • engine limits •