Base | Representation |
---|---|
bin | 110111101000101100101111… |
… | …0010101101111111111111111 |
3 | 2101011202011002021002121222222 |
4 | 1233101121132111233333333 |
5 | 1003120440133034311032 |
6 | 4452453254211555555 |
7 | 205036306355112146 |
oct | 15721313625577777 |
9 | 2334664067077888 |
10 | 489378746400767 |
11 | 131a273a72a1613 |
12 | 46a78a67bbbbbb |
13 | 1800b2aa593462 |
14 | 88bc0b44bc75d |
15 | 3b89ce6ce9a12 |
hex | 1bd165e56ffff |
489378746400767 has 4 divisors (see below), whose sum is σ = 489449496551736. Its totient is φ = 489307996249800.
The previous prime is 489378746400701. The next prime is 489378746400769. The reversal of 489378746400767 is 767004647873984.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 489378746400767 - 210 = 489378746399743 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 489378746400691 and 489378746400700.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (489378746400769) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 35375065109 + ... + 35375078942.
It is an arithmetic number, because the mean of its divisors is an integer number (122362374137934).
Almost surely, 2489378746400767 is an apocalyptic number.
489378746400767 is a deficient number, since it is larger than the sum of its proper divisors (70750150969).
489378746400767 is an equidigital number, since it uses as much as digits as its factorization.
489378746400767 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70750150968.
The product of its (nonzero) digits is 9559130112, while the sum is 80.
The spelling of 489378746400767 in words is "four hundred eighty-nine trillion, three hundred seventy-eight billion, seven hundred forty-six million, four hundred thousand, seven hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •