Base | Representation |
---|---|
bin | 1101100001001000100… |
… | …11100001001100110000 |
3 | 1122101212101220100120111 |
4 | 12300210103201030300 |
5 | 30102211141030324 |
6 | 553212244551104 |
7 | 45361614105046 |
oct | 6604423411460 |
9 | 1571771810514 |
10 | 464465564464 |
11 | 169a84780100 |
12 | 760246b2494 |
13 | 34a502a6165 |
14 | 186a1b5a396 |
15 | c1361d6794 |
hex | 6c244e1330 |
464465564464 has 120 divisors (see below), whose sum is σ = 1081121053824. Its totient is φ = 192291686400.
The previous prime is 464465564461. The next prime is 464465564489.
464465564464 is nontrivially palindromic in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 464465564399 and 464465564408.
It is not an unprimeable number, because it can be changed into a prime (464465564461) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 792654 + ... + 1247890.
Almost surely, 2464465564464 is an apocalyptic number.
464465564464 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 464465564464, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (540560526912).
464465564464 is an abundant number, since it is smaller than the sum of its proper divisors (616655489360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
464465564464 is a wasteful number, since it uses less digits than its factorization.
464465564464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 455315 (or 455298 counting only the distinct ones).
The product of its digits is 132710400, while the sum is 58.
The spelling of 464465564464 in words is "four hundred sixty-four billion, four hundred sixty-five million, five hundred sixty-four thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •