Base | Representation |
---|---|
bin | 1011100100000111… |
… | …0000011010111001 |
3 | 22000100012000012002 |
4 | 2321001300122321 |
5 | 22324141323213 |
6 | 1232010430345 |
7 | 136632436142 |
oct | 27101603271 |
9 | 8010160162 |
10 | 3104245433 |
11 | 13532a15a3 |
12 | 7277323b5 |
13 | 3a6183523 |
14 | 2163c0ac9 |
15 | 1327d6658 |
hex | b90706b9 |
3104245433 has 2 divisors, whose sum is σ = 3104245434. Its totient is φ = 3104245432.
The previous prime is 3104245429. The next prime is 3104245447. The reversal of 3104245433 is 3345424013.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2890997824 + 213247609 = 53768^2 + 14603^2 .
It is an emirp because it is prime and its reverse (3345424013) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3104245433 - 22 = 3104245429 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3104245396 and 3104245405.
It is not a weakly prime, because it can be changed into another prime (3104245483) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1552122716 + 1552122717.
It is an arithmetic number, because the mean of its divisors is an integer number (1552122717).
Almost surely, 23104245433 is an apocalyptic number.
It is an amenable number.
3104245433 is a deficient number, since it is larger than the sum of its proper divisors (1).
3104245433 is an equidigital number, since it uses as much as digits as its factorization.
3104245433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 29.
The square root of 3104245433 is about 55715.7556980070. The cubic root of 3104245433 is about 1458.7650520675.
Adding to 3104245433 its reverse (3345424013), we get a palindrome (6449669446).
The spelling of 3104245433 in words is "three billion, one hundred four million, two hundred forty-five thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •