Base | Representation |
---|---|
bin | 1100000111011110… |
… | …1100001001001111 |
3 | 22101200100021100101 |
4 | 3001313230021033 |
5 | 23130131221143 |
6 | 1254430311531 |
7 | 143413440661 |
oct | 30167541117 |
9 | 8350307311 |
10 | 3252601423 |
11 | 141a010655 |
12 | 7693585a7 |
13 | 3cab28036 |
14 | 22bd9c531 |
15 | 14083db4d |
hex | c1dec24f |
3252601423 has 2 divisors, whose sum is σ = 3252601424. Its totient is φ = 3252601422.
The previous prime is 3252601369. The next prime is 3252601433. The reversal of 3252601423 is 3241062523.
It is a strong prime.
It is an emirp because it is prime and its reverse (3241062523) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3252601423 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3252601391 and 3252601400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3252601433) 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, 1626300711 + 1626300712.
It is an arithmetic number, because the mean of its divisors is an integer number (1626300712).
Almost surely, 23252601423 is an apocalyptic number.
3252601423 is a deficient number, since it is larger than the sum of its proper divisors (1).
3252601423 is an equidigital number, since it uses as much as digits as its factorization.
3252601423 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 28.
The square root of 3252601423 is about 57031.5826801256. The cubic root of 3252601423 is about 1481.6431444641.
Adding to 3252601423 its reverse (3241062523), we get a palindrome (6493663946).
The spelling of 3252601423 in words is "three billion, two hundred fifty-two million, six hundred one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •