Base | Representation |
---|---|
bin | 10101000010101… |
… | …000110110011001 |
3 | 220121020220222221 |
4 | 111002220312121 |
5 | 1210332410040 |
6 | 55010144041 |
7 | 11514363562 |
oct | 2502506631 |
9 | 817226887 |
10 | 353013145 |
11 | 1712a3001 |
12 | 9a282021 |
13 | 5819c824 |
14 | 34c53169 |
15 | 20ed174a |
hex | 150a8d99 |
353013145 has 8 divisors (see below), whose sum is σ = 423738504. Its totient is φ = 282328704.
The previous prime is 353013127. The next prime is 353013149. The reversal of 353013145 is 541310353.
It can be written as a sum of positive squares in 4 ways, for example, as 28869129 + 324144016 = 5373^2 + 18004^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 353013145 - 25 = 353013113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (353013149) 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 7 ways as a sum of consecutive naturals, for example, 13957 + ... + 30013.
It is an arithmetic number, because the mean of its divisors is an integer number (52967313).
Almost surely, 2353013145 is an apocalyptic number.
It is an amenable number.
353013145 is a deficient number, since it is larger than the sum of its proper divisors (70725359).
353013145 is a wasteful number, since it uses less digits than its factorization.
353013145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20459.
The product of its (nonzero) digits is 2700, while the sum is 25.
The square root of 353013145 is about 18788.6440436770. The cubic root of 353013145 is about 706.7464338530.
Adding to 353013145 its reverse (541310353), we get a palindrome (894323498).
The spelling of 353013145 in words is "three hundred fifty-three million, thirteen thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •