Base | Representation |
---|---|
bin | 10101000110011… |
… | …111111000110101 |
3 | 220200011100000112 |
4 | 111012133320311 |
5 | 1211112300023 |
6 | 55043552405 |
7 | 11526106616 |
oct | 2506377065 |
9 | 820140015 |
10 | 354025013 |
11 | 171924261 |
12 | 9a68b705 |
13 | 58465274 |
14 | 35037c0d |
15 | 21131478 |
hex | 1519fe35 |
354025013 has 2 divisors, whose sum is σ = 354025014. Its totient is φ = 354025012.
The previous prime is 354025003. The next prime is 354025027. The reversal of 354025013 is 310520453.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 258630724 + 95394289 = 16082^2 + 9767^2 .
It is a cyclic number.
It is not a de Polignac number, because 354025013 - 24 = 354024997 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 354025013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (354025003) 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, 177012506 + 177012507.
It is an arithmetic number, because the mean of its divisors is an integer number (177012507).
Almost surely, 2354025013 is an apocalyptic number.
It is an amenable number.
354025013 is a deficient number, since it is larger than the sum of its proper divisors (1).
354025013 is an equidigital number, since it uses as much as digits as its factorization.
354025013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1800, while the sum is 23.
The square root of 354025013 is about 18815.5524234608. The cubic root of 354025013 is about 707.4210564233.
Adding to 354025013 its reverse (310520453), we get a palindrome (664545466).
The spelling of 354025013 in words is "three hundred fifty-four million, twenty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •