Base | Representation |
---|---|
bin | 1101100010010010100… |
… | …11010011011001111000 |
3 | 1122110110122212012120110 |
4 | 12301021103103121320 |
5 | 30104444040434302 |
6 | 553354020424320 |
7 | 45413162011341 |
oct | 6611123233170 |
9 | 1573418765513 |
10 | 465086264952 |
11 | 16a273087611 |
12 | 761785480a0 |
13 | 34b1ba6bc5a |
14 | 187203710c8 |
15 | c170942b6c |
hex | 6c494d3678 |
465086264952 has 32 divisors (see below), whose sum is σ = 1162742590800. Its totient is φ = 155025164544.
The previous prime is 465086264941. The next prime is 465086264957. The reversal of 465086264952 is 259462680564.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 465086264892 and 465086264901.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (465086264957) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 961324 + ... + 1361732.
Almost surely, 2465086264952 is an apocalyptic number.
It is an amenable number.
465086264952 is an abundant number, since it is smaller than the sum of its proper divisors (697656325848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
465086264952 is a wasteful number, since it uses less digits than its factorization.
465086264952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 448815 (or 448811 counting only the distinct ones).
The product of its (nonzero) digits is 24883200, while the sum is 57.
The spelling of 465086264952 in words is "four hundred sixty-five billion, eighty-six million, two hundred sixty-four thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •