Base | Representation |
---|---|
bin | 1101101001001000000… |
… | …01110000110000000000 |
3 | 1122210221101212210202202 |
4 | 12310210001300300000 |
5 | 30140003001024424 |
6 | 555202105132332 |
7 | 45603131132342 |
oct | 6644401606000 |
9 | 1583841783682 |
10 | 468755876864 |
11 | 170886521330 |
12 | 76a2148a0a8 |
13 | 352850b3052 |
14 | 1898b881292 |
15 | c2d7ba52ae |
hex | 6d24070c00 |
468755876864 has 66 divisors (see below), whose sum is σ = 1022399197092. Its totient is φ = 213037824000.
The previous prime is 468755876839. The next prime is 468755876867. The reversal of 468755876864 is 468678557864.
It is a junction number, because it is equal to n+sod(n) for n = 468755876791 and 468755876800.
It is not an unprimeable number, because it can be changed into a prime (468755876867) 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, 72660839 + ... + 72667289.
Almost surely, 2468755876864 is an apocalyptic number.
468755876864 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 468755876864, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (511199598546).
468755876864 is an abundant number, since it is smaller than the sum of its proper divisors (553643320228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
468755876864 is an frugal number, since it uses more digits than its factorization.
468755876864 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12933 (or 6464 counting only the distinct ones).
The product of its digits is 2167603200, while the sum is 74.
The spelling of 468755876864 in words is "four hundred sixty-eight billion, seven hundred fifty-five million, eight hundred seventy-six thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •