Base | Representation |
---|---|
bin | 10100111000011… |
… | …000100111010001 |
3 | 220102012100211110 |
4 | 110320120213101 |
5 | 1204140401301 |
6 | 54432403533 |
7 | 11452500162 |
oct | 2470304721 |
9 | 812170743 |
10 | 350325201 |
11 | 16a827566 |
12 | 993a65a9 |
13 | 5776b225 |
14 | 34753769 |
15 | 20b500d6 |
hex | 14e189d1 |
350325201 has 4 divisors (see below), whose sum is σ = 467100272. Its totient is φ = 233550132.
The previous prime is 350325193. The next prime is 350325251. The reversal of 350325201 is 102523053.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 102523053 = 3 ⋅34174351.
It is not a de Polignac number, because 350325201 - 23 = 350325193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (350325251) 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 in 3 ways as a sum of consecutive naturals, for example, 58387531 + ... + 58387536.
It is an arithmetic number, because the mean of its divisors is an integer number (116775068).
Almost surely, 2350325201 is an apocalyptic number.
It is an amenable number.
350325201 is a deficient number, since it is larger than the sum of its proper divisors (116775071).
350325201 is a wasteful number, since it uses less digits than its factorization.
350325201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116775070.
The product of its (nonzero) digits is 900, while the sum is 21.
The square root of 350325201 is about 18716.9762782347. The cubic root of 350325201 is about 704.9480712217.
Adding to 350325201 its reverse (102523053), we get a palindrome (452848254).
The spelling of 350325201 in words is "three hundred fifty million, three hundred twenty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •