Base | Representation |
---|---|
bin | 1001011010010001010… |
… | …00000101000000110001 |
3 | 1010220121012011100021121 |
4 | 10231020220011000301 |
5 | 20244200244404131 |
6 | 404312452022241 |
7 | 32234456156134 |
oct | 4551050050061 |
9 | 1126535140247 |
10 | 323341013041 |
11 | 115145632922 |
12 | 527ba301981 |
13 | 2464c748527 |
14 | 1191503c21b |
15 | 86268ce911 |
hex | 4b48a05031 |
323341013041 has 2 divisors, whose sum is σ = 323341013042. Its totient is φ = 323341013040.
The previous prime is 323341012961. The next prime is 323341013053. The reversal of 323341013041 is 140310143323.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 294636182416 + 28704830625 = 542804^2 + 169425^2 .
It is a cyclic number.
It is not a de Polignac number, because 323341013041 - 233 = 314751078449 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 323341012997 and 323341013015.
It is not a weakly prime, because it can be changed into another prime (323341013641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161670506520 + 161670506521.
It is an arithmetic number, because the mean of its divisors is an integer number (161670506521).
Almost surely, 2323341013041 is an apocalyptic number.
It is an amenable number.
323341013041 is a deficient number, since it is larger than the sum of its proper divisors (1).
323341013041 is an equidigital number, since it uses as much as digits as its factorization.
323341013041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 323341013041 its reverse (140310143323), we get a palindrome (463651156364).
The spelling of 323341013041 in words is "three hundred twenty-three billion, three hundred forty-one million, thirteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •