Base | Representation |
---|---|
bin | 1000001100000110110… |
… | …10011110100110111001 |
3 | 222220021200122122110202 |
4 | 10012003122132212321 |
5 | 14102230133140044 |
6 | 333132455051545 |
7 | 26220541253333 |
oct | 4060332364671 |
9 | 886250578422 |
10 | 281377630649 |
11 | a9371378605 |
12 | 46648970bb5 |
13 | 206c299ca4b |
14 | d893bc8453 |
15 | 74bc869c4e |
hex | 418369e9b9 |
281377630649 has 2 divisors, whose sum is σ = 281377630650. Its totient is φ = 281377630648.
The previous prime is 281377630637. The next prime is 281377630739. The reversal of 281377630649 is 946036773182.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 265225000000 + 16152630649 = 515000^2 + 127093^2 .
It is a cyclic number.
It is not a de Polignac number, because 281377630649 - 28 = 281377630393 is a prime.
It is a super-2 number, since 2×2813776306492 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 281377630594 and 281377630603.
It is not a weakly prime, because it can be changed into another prime (281377630349) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 140688815324 + 140688815325.
It is an arithmetic number, because the mean of its divisors is an integer number (140688815325).
Almost surely, 2281377630649 is an apocalyptic number.
It is an amenable number.
281377630649 is a deficient number, since it is larger than the sum of its proper divisors (1).
281377630649 is an equidigital number, since it uses as much as digits as its factorization.
281377630649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9144576, while the sum is 56.
The spelling of 281377630649 in words is "two hundred eighty-one billion, three hundred seventy-seven million, six hundred thirty thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •