Base | Representation |
---|---|
bin | 100001011101110… |
… | …100000001010101 |
3 | 1110010111021222001 |
4 | 201131310001111 |
5 | 2122213312011 |
6 | 131414035301 |
7 | 16625234323 |
oct | 4135640125 |
9 | 1403437861 |
10 | 561463381 |
11 | 268a27826 |
12 | 138048b31 |
13 | 8c42516b |
14 | 547d4d13 |
15 | 344597c1 |
hex | 21774055 |
561463381 has 2 divisors, whose sum is σ = 561463382. Its totient is φ = 561463380.
The previous prime is 561463321. The next prime is 561463421. The reversal of 561463381 is 183364165.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 376748100 + 184715281 = 19410^2 + 13591^2 .
It is a cyclic number.
It is not a de Polignac number, because 561463381 - 211 = 561461333 is a prime.
It is a super-2 number, since 2×5614633812 = 630482256407902322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 561463381.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (561463321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 280731690 + 280731691.
It is an arithmetic number, because the mean of its divisors is an integer number (280731691).
Almost surely, 2561463381 is an apocalyptic number.
It is an amenable number.
561463381 is a deficient number, since it is larger than the sum of its proper divisors (1).
561463381 is an equidigital number, since it uses as much as digits as its factorization.
561463381 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 51840, while the sum is 37.
The square root of 561463381 is about 23695.2185261078. The cubic root of 561463381 is about 824.9744129193.
The spelling of 561463381 in words is "five hundred sixty-one million, four hundred sixty-three thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •