Base | Representation |
---|---|
bin | 110110101010110101110110… |
… | …1000010011111001110001001 |
3 | 2100001122101212021101021022111 |
4 | 1231111223231002133032021 |
5 | 1001012142302420401423 |
6 | 4422423520433022321 |
7 | 203201136644461561 |
oct | 15525535502371611 |
9 | 2301571767337274 |
10 | 480877105247113 |
11 | 12a249920520953 |
12 | 45b252556b49a1 |
13 | 17842693839ac3 |
14 | 86a680ca91da1 |
15 | 3a8dab512360d |
hex | 1b55aed09f389 |
480877105247113 has 2 divisors, whose sum is σ = 480877105247114. Its totient is φ = 480877105247112.
The previous prime is 480877105247093. The next prime is 480877105247233. The reversal of 480877105247113 is 311742501778084.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 330517199537424 + 150359905709689 = 18180132^2 + 12262133^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-480877105247113 is a prime.
It is a super-3 number, since 3×4808771052471133 (a number of 45 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (480877105244113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 240438552623556 + 240438552623557.
It is an arithmetic number, because the mean of its divisors is an integer number (240438552623557).
Almost surely, 2480877105247113 is an apocalyptic number.
It is an amenable number.
480877105247113 is a deficient number, since it is larger than the sum of its proper divisors (1).
480877105247113 is an equidigital number, since it uses as much as digits as its factorization.
480877105247113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10536960, while the sum is 58.
The spelling of 480877105247113 in words is "four hundred eighty trillion, eight hundred seventy-seven billion, one hundred five million, two hundred forty-seven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •