Base | Representation |
---|---|
bin | 111001011001100110… |
… | …110101010001100001 |
3 | 12220002022011102021121 |
4 | 321121212311101201 |
5 | 2002211010102144 |
6 | 44151434452241 |
7 | 4311214645516 |
oct | 713146652141 |
9 | 186068142247 |
10 | 61632894049 |
11 | 24158186581 |
12 | bb40894081 |
13 | 5a72b3c29c |
14 | 2da96ab30d |
15 | 190ac9d384 |
hex | e599b5461 |
61632894049 has 2 divisors, whose sum is σ = 61632894050. Its totient is φ = 61632894048.
The previous prime is 61632893999. The next prime is 61632894067. The reversal of 61632894049 is 94049823616.
61632894049 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 50787129600 + 10845764449 = 225360^2 + 104143^2 .
It is a cyclic number.
It is not a de Polignac number, because 61632894049 - 29 = 61632893537 is a prime.
It is a super-2 number, since 2×616328940492 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 61632893987 and 61632894005.
It is not a weakly prime, because it can be changed into another prime (61632894149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30816447024 + 30816447025.
It is an arithmetic number, because the mean of its divisors is an integer number (30816447025).
Almost surely, 261632894049 is an apocalyptic number.
It is an amenable number.
61632894049 is a deficient number, since it is larger than the sum of its proper divisors (1).
61632894049 is an equidigital number, since it uses as much as digits as its factorization.
61632894049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2239488, while the sum is 52.
The spelling of 61632894049 in words is "sixty-one billion, six hundred thirty-two million, eight hundred ninety-four thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •