Base | Representation |
---|---|
bin | 110101001110011011011111… |
… | …0001000110110000000000000 |
3 | 2021101200012100101102111020120 |
4 | 1222130312332020312000000 |
5 | 442331044123110333411 |
6 | 4335421044201340240 |
7 | 200420415130102104 |
oct | 15234667610660000 |
9 | 2241605311374216 |
10 | 468176100089856 |
11 | 1261a24071a1984 |
12 | 446137b8797680 |
13 | 17130a806888a2 |
14 | 8387bb64bb904 |
15 | 391d504c9b106 |
hex | 1a9cdbe236000 |
468176100089856 has 112 divisors (see below), whose sum is σ = 1248575593014000. Its totient is φ = 156035924492288.
The previous prime is 468176100089827. The next prime is 468176100089861. The reversal of 468176100089856 is 658980001671864.
It is a hoax number, since the sum of its digits (69) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 167425870 + ... + 170199218.
Almost surely, 2468176100089856 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 468176100089856, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (624287796507000).
468176100089856 is an abundant number, since it is smaller than the sum of its proper divisors (780399492924144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
468176100089856 is an equidigital number, since it uses as much as digits as its factorization.
468176100089856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2780247 (or 2780223 counting only the distinct ones).
The product of its (nonzero) digits is 139345920, while the sum is 69.
The spelling of 468176100089856 in words is "four hundred sixty-eight trillion, one hundred seventy-six billion, one hundred million, eighty-nine thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •