Base | Representation |
---|---|
bin | 1001011010011000111… |
… | …01001000001010101001 |
3 | 1010220202200000222112012 |
4 | 10231030131020022221 |
5 | 20244313221014431 |
6 | 404323104525305 |
7 | 32236166164412 |
oct | 4551435101251 |
9 | 1126680028465 |
10 | 323405251241 |
11 | 115178918a46 |
12 | 52817920835 |
13 | 2465cb4a5b7 |
14 | 1191d7a0809 |
15 | 862c36d22b |
hex | 4b4c7482a9 |
323405251241 has 2 divisors, whose sum is σ = 323405251242. Its totient is φ = 323405251240.
The previous prime is 323405251201. The next prime is 323405251259. The reversal of 323405251241 is 142152504323.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 311331636841 + 12073614400 = 557971^2 + 109880^2 .
It is a cyclic number.
It is not a de Polignac number, because 323405251241 - 214 = 323405234857 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 323405251198 and 323405251207.
It is not a weakly prime, because it can be changed into another prime (323405251201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 161702625620 + 161702625621.
It is an arithmetic number, because the mean of its divisors is an integer number (161702625621).
Almost surely, 2323405251241 is an apocalyptic number.
It is an amenable number.
323405251241 is a deficient number, since it is larger than the sum of its proper divisors (1).
323405251241 is an equidigital number, since it uses as much as digits as its factorization.
323405251241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28800, while the sum is 32.
Adding to 323405251241 its reverse (142152504323), we get a palindrome (465557755564).
The spelling of 323405251241 in words is "three hundred twenty-three billion, four hundred five million, two hundred fifty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •