Base | Representation |
---|---|
bin | 110110111011101100101100… |
… | …1111010000001010111110101 |
3 | 2100100211212222000102020010121 |
4 | 1231313121121322001113311 |
5 | 1001313122121243214124 |
6 | 4431400115542451541 |
7 | 203530415521443436 |
oct | 15567313172012765 |
9 | 2310755860366117 |
10 | 483193919116789 |
11 | 12aa624325580a1 |
12 | 4623a275a33bb1 |
13 | 1797ccb6483b8a |
14 | 87469d375148d |
15 | 3acdeb196c2e4 |
hex | 1b77659e815f5 |
483193919116789 has 2 divisors, whose sum is σ = 483193919116790. Its totient is φ = 483193919116788.
The previous prime is 483193919116759. The next prime is 483193919116829. The reversal of 483193919116789 is 987611919391384.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 275261845094289 + 207932074022500 = 16591017^2 + 14419850^2 .
It is a cyclic number.
It is not a de Polignac number, because 483193919116789 - 213 = 483193919108597 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (483193919116759) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 241596959558394 + 241596959558395.
It is an arithmetic number, because the mean of its divisors is an integer number (241596959558395).
Almost surely, 2483193919116789 is an apocalyptic number.
It is an amenable number.
483193919116789 is a deficient number, since it is larger than the sum of its proper divisors (1).
483193919116789 is an equidigital number, since it uses as much as digits as its factorization.
483193919116789 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 634894848, while the sum is 79.
The spelling of 483193919116789 in words is "four hundred eighty-three trillion, one hundred ninety-three billion, nine hundred nineteen million, one hundred sixteen thousand, seven hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •