Base | Representation |
---|---|
bin | 11011101110010… |
… | …001000100001001 |
3 | 1012102012012120111 |
4 | 123232101010021 |
5 | 1423032111403 |
6 | 114052554321 |
7 | 14345253415 |
oct | 3356210411 |
9 | 1172165514 |
10 | 465113353 |
11 | 2195a9601 |
12 | 10b9229a1 |
13 | 7548bb03 |
14 | 45ab3d45 |
15 | 2ac7656d |
hex | 1bb91109 |
465113353 has 8 divisors (see below), whose sum is σ = 493336872. Its totient is φ = 436985856.
The previous prime is 465113333. The next prime is 465113357. The reversal of 465113353 is 353311564.
It can be written as a sum of positive squares in 4 ways, for example, as 183142089 + 281971264 = 13533^2 + 16792^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 465113353 - 29 = 465112841 is a prime.
It is a super-2 number, since 2×4651133532 = 432660862277805218, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (465113357) 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, 13900 + ... + 33517.
It is an arithmetic number, because the mean of its divisors is an integer number (61667109).
Almost surely, 2465113353 is an apocalyptic number.
It is an amenable number.
465113353 is a deficient number, since it is larger than the sum of its proper divisors (28223519).
465113353 is a wasteful number, since it uses less digits than its factorization.
465113353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48011.
The product of its digits is 16200, while the sum is 31.
The square root of 465113353 is about 21566.4868024442. The cubic root of 465113353 is about 774.7940364231.
The spelling of 465113353 in words is "four hundred sixty-five million, one hundred thirteen thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •