Base | Representation |
---|---|
bin | 11011101110100… |
… | …110011111100101 |
3 | 1012102100122222022 |
4 | 123232212133211 |
5 | 1423042414000 |
6 | 114054512525 |
7 | 14346100334 |
oct | 3356463745 |
9 | 1172318868 |
10 | 465201125 |
11 | 219659544 |
12 | 10b965745 |
13 | 754bca4c |
14 | 45ad7d1b |
15 | 2ac92585 |
hex | 1bba67e5 |
465201125 has 16 divisors (see below), whose sum is σ = 581508720. Its totient is φ = 371560000.
The previous prime is 465201103. The next prime is 465201137. The reversal of 465201125 is 521102564.
It can be written as a sum of positive squares in 8 ways, for example, as 223771681 + 241429444 = 14959^2 + 15538^2 .
It is a de Polignac number, because none of the positive numbers 2k-465201125 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 465201094 and 465201103.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 84971 + ... + 90279.
It is an arithmetic number, because the mean of its divisors is an integer number (36344295).
Almost surely, 2465201125 is an apocalyptic number.
It is an amenable number.
465201125 is a deficient number, since it is larger than the sum of its proper divisors (116307595).
465201125 is an equidigital number, since it uses as much as digits as its factorization.
465201125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6025 (or 6015 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 26.
The square root of 465201125 is about 21568.5216229578. The cubic root of 465201125 is about 774.8427707402.
Adding to 465201125 its reverse (521102564), we get a palindrome (986303689).
The spelling of 465201125 in words is "four hundred sixty-five million, two hundred one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •