Base | Representation |
---|---|
bin | 1110000000111001001… |
… | …10101100000111100001 |
3 | 1201000212200202111010211 |
4 | 13000130212230013201 |
5 | 30342121124211002 |
6 | 1005112220054121 |
7 | 46534264343263 |
oct | 7003446540741 |
9 | 1630780674124 |
10 | 481516241377 |
11 | 176234402026 |
12 | 793a2994341 |
13 | 36539930ab2 |
14 | 1943c46bb33 |
15 | c7d306ddd7 |
hex | 701c9ac1e1 |
481516241377 has 2 divisors, whose sum is σ = 481516241378. Its totient is φ = 481516241376.
The previous prime is 481516241347. The next prime is 481516241389. The reversal of 481516241377 is 773142615184.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 253375316496 + 228140924881 = 503364^2 + 477641^2 .
It is a cyclic number.
It is not a de Polignac number, because 481516241377 - 27 = 481516241249 is a prime.
It is a super-2 number, since 2×4815162413772 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 481516241377.
It is not a weakly prime, because it can be changed into another prime (481516241347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 240758120688 + 240758120689.
It is an arithmetic number, because the mean of its divisors is an integer number (240758120689).
Almost surely, 2481516241377 is an apocalyptic number.
It is an amenable number.
481516241377 is a deficient number, since it is larger than the sum of its proper divisors (1).
481516241377 is an equidigital number, since it uses as much as digits as its factorization.
481516241377 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1128960, while the sum is 49.
The spelling of 481516241377 in words is "four hundred eighty-one billion, five hundred sixteen million, two hundred forty-one thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.152 sec. • engine limits •