Base | Representation |
---|---|
bin | 10011111110010… |
… | …010010111001001 |
3 | 212100112121020212 |
4 | 103332102113021 |
5 | 1141241021431 |
6 | 53130130505 |
7 | 11206156025 |
oct | 2376222711 |
9 | 770477225 |
10 | 335095241 |
11 | 162175018 |
12 | 94280a35 |
13 | 54568010 |
14 | 3270b385 |
15 | 1e64272b |
hex | 13f925c9 |
335095241 has 8 divisors (see below), whose sum is σ = 362423880. Its totient is φ = 307988352.
The previous prime is 335095231. The next prime is 335095247. The reversal of 335095241 is 142590533.
It can be written as a sum of positive squares in 4 ways, for example, as 10374841 + 324720400 = 3221^2 + 18020^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-335095241 is a prime.
It is a super-2 number, since 2×3350952412 = 224577641081696162, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 335095198 and 335095207.
It is not an unprimeable number, because it can be changed into a prime (335095247) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 52286 + ... + 58343.
It is an arithmetic number, because the mean of its divisors is an integer number (45302985).
Almost surely, 2335095241 is an apocalyptic number.
It is an amenable number.
335095241 is a deficient number, since it is larger than the sum of its proper divisors (27328639).
335095241 is a wasteful number, since it uses less digits than its factorization.
335095241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110875.
The product of its (nonzero) digits is 16200, while the sum is 32.
The square root of 335095241 is about 18305.6068186772. The cubic root of 335095241 is about 694.5807667798.
The spelling of 335095241 in words is "three hundred thirty-five million, ninety-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •