Base | Representation |
---|---|
bin | 11011110001010… |
… | …011011011110101 |
3 | 1012110200122200011 |
4 | 123301103123311 |
5 | 1423233100433 |
6 | 114122020221 |
7 | 14355110500 |
oct | 3361233365 |
9 | 1173618604 |
10 | 465909493 |
11 | 219aa2775 |
12 | 110047671 |
13 | 756aa2ba |
14 | 45c40137 |
15 | 2ad823cd |
hex | 1bc536f5 |
465909493 has 6 divisors (see below), whose sum is σ = 541976406. Its totient is φ = 399350952.
The previous prime is 465909481. The next prime is 465909523. The reversal of 465909493 is 394909564.
It can be written as a sum of positive squares in only one way, i.e., 443649969 + 22259524 = 21063^2 + 4718^2 .
It is not a de Polignac number, because 465909493 - 29 = 465908981 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (49), and also a Moran number because the ratio is a prime number: 9508357 = 465909493 / (4 + 6 + 5 + 9 + 0 + 9 + 4 + 9 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (465909403) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 4754130 + ... + 4754227.
It is an arithmetic number, because the mean of its divisors is an integer number (90329401).
Almost surely, 2465909493 is an apocalyptic number.
It is an amenable number.
465909493 is a deficient number, since it is larger than the sum of its proper divisors (76066913).
465909493 is an equidigital number, since it uses as much as digits as its factorization.
465909493 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9508371 (or 9508364 counting only the distinct ones).
The product of its (nonzero) digits is 1049760, while the sum is 49.
The square root of 465909493 is about 21584.9367152188. The cubic root of 465909493 is about 775.2358591180.
The spelling of 465909493 in words is "four hundred sixty-five million, nine hundred nine thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •