Base | Representation |
---|---|
bin | 1101100000101100100… |
… | …01000010010001010000 |
3 | 1122101020222201002102002 |
4 | 12300112101002101100 |
5 | 30101220342014324 |
6 | 553133032413132 |
7 | 45353024111612 |
oct | 6602621022120 |
9 | 1571228632362 |
10 | 464230032464 |
11 | 169973829460 |
12 | 75b798471a8 |
13 | 34a1355ac03 |
14 | 1867c768db2 |
15 | c1206ae3ae |
hex | 6c16442450 |
464230032464 has 40 divisors (see below), whose sum is σ = 983314751328. Its totient is φ = 210561764480.
The previous prime is 464230032463. The next prime is 464230032491.
464230032464 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×4642300324642 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (464230032463) 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, 2741867 + ... + 2906250.
Almost surely, 2464230032464 is an apocalyptic number.
464230032464 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
464230032464 is an abundant number, since it is smaller than the sum of its proper divisors (519084718864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
464230032464 is a wasteful number, since it uses less digits than its factorization.
464230032464 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5648603 (or 5648597 counting only the distinct ones).
The product of its (nonzero) digits is 331776, while the sum is 38.
It can be divided in two parts, 4642300 and 32464, that added together give a palindrome (4674764).
The spelling of 464230032464 in words is "four hundred sixty-four billion, two hundred thirty million, thirty-two thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •