Base | Representation |
---|---|
bin | 110111101010000101001001… |
… | …0010101010111010101100000 |
3 | 2101012102022010022000100122111 |
4 | 1233110022102111113111200 |
5 | 1003132042441400313000 |
6 | 4453120413031045104 |
7 | 205056110140661134 |
oct | 15724122225272540 |
9 | 2335368108010574 |
10 | 489568597276000 |
11 | 131a9a9701540a0 |
12 | 46aa9810810794 |
13 | 18023175041758 |
14 | 88c73646dd3c4 |
15 | 3b8ec09255cba |
hex | 1bd4292557560 |
489568597276000 has 768 divisors, whose sum is σ = 1378560780140544. Its totient is φ = 169246022400000.
The previous prime is 489568597275959. The next prime is 489568597276007. The reversal of 489568597276000 is 672795865984.
It is a super-2 number, since 2×4895685972760002 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 489568597275899 and 489568597275908.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (489568597276007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 27406843069 + ... + 27406860931.
It is an arithmetic number, because the mean of its divisors is an integer number (1795001015808).
Almost surely, 2489568597276000 is an apocalyptic number.
489568597276000 is a gapful number since it is divisible by the number (40) 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 489568597276000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (689280390070272).
489568597276000 is an abundant number, since it is smaller than the sum of its proper divisors (888992182864544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
489568597276000 is a wasteful number, since it uses less digits than its factorization.
489568597276000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18284 (or 18266 counting only the distinct ones).
The product of its (nonzero) digits is 1828915200, while the sum is 76.
The spelling of 489568597276000 in words is "four hundred eighty-nine trillion, five hundred sixty-eight billion, five hundred ninety-seven million, two hundred seventy-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •