Base | Representation |
---|---|
bin | 1100000111111011… |
… | …1100111000110101 |
3 | 22101210220222120201 |
4 | 3001332330320311 |
5 | 23131123130023 |
6 | 1254535200501 |
7 | 143435556544 |
oct | 30176747065 |
9 | 8353828521 |
10 | 3254505013 |
11 | 14200a0871 |
12 | 769b16131 |
13 | 3cb343616 |
14 | 22c33615b |
15 | 140ab7bad |
hex | c1fbce35 |
3254505013 has 2 divisors, whose sum is σ = 3254505014. Its totient is φ = 3254505012.
The previous prime is 3254504999. The next prime is 3254505017. The reversal of 3254505013 is 3105054523.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1895992849 + 1358512164 = 43543^2 + 36858^2 .
It is an emirp because it is prime and its reverse (3105054523) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3254505013 - 225 = 3220950581 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3254505017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1627252506 + 1627252507.
It is an arithmetic number, because the mean of its divisors is an integer number (1627252507).
Almost surely, 23254505013 is an apocalyptic number.
It is an amenable number.
3254505013 is a deficient number, since it is larger than the sum of its proper divisors (1).
3254505013 is an equidigital number, since it uses as much as digits as its factorization.
3254505013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9000, while the sum is 28.
The square root of 3254505013 is about 57048.2691499050. The cubic root of 3254505013 is about 1481.9321327397.
Adding to 3254505013 its reverse (3105054523), we get a palindrome (6359559536).
The spelling of 3254505013 in words is "three billion, two hundred fifty-four million, five hundred five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •