Base | Representation |
---|---|
bin | 1100000100100010… |
… | …0010011110100101 |
3 | 22100211002022010012 |
4 | 3001020202132211 |
5 | 23114000203221 |
6 | 1253305340005 |
7 | 143203410641 |
oct | 30110423645 |
9 | 8324068105 |
10 | 3240241061 |
11 | 1413039082 |
12 | 765197605 |
13 | 3c83bb005 |
14 | 22a4a1c21 |
15 | 13e6eb65b |
hex | c12227a5 |
3240241061 has 2 divisors, whose sum is σ = 3240241062. Its totient is φ = 3240241060.
The previous prime is 3240241007. The next prime is 3240241073. The reversal of 3240241061 is 1601420423.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2389352161 + 850888900 = 48881^2 + 29170^2 .
It is an emirp because it is prime and its reverse (1601420423) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3240241061 - 210 = 3240240037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3240241091) 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, 1620120530 + 1620120531.
It is an arithmetic number, because the mean of its divisors is an integer number (1620120531).
Almost surely, 23240241061 is an apocalyptic number.
It is an amenable number.
3240241061 is a deficient number, since it is larger than the sum of its proper divisors (1).
3240241061 is an equidigital number, since it uses as much as digits as its factorization.
3240241061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
The square root of 3240241061 is about 56923.1153486877. The cubic root of 3240241061 is about 1479.7639416850.
Adding to 3240241061 its reverse (1601420423), we get a palindrome (4841661484).
The spelling of 3240241061 in words is "three billion, two hundred forty million, two hundred forty-one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •