Base | Representation |
---|---|
bin | 100001111001101010… |
… | …111110000000111001 |
3 | 10110221211222201010122 |
4 | 201321222332000321 |
5 | 1044022131424221 |
6 | 24420012423025 |
7 | 2426023532156 |
oct | 417152760071 |
9 | 113854881118 |
10 | 36401045561 |
11 | 1448a494331 |
12 | 707a777a75 |
13 | 358157a31a |
14 | 1a9461122d |
15 | e30a7eeab |
hex | 879abe039 |
36401045561 has 2 divisors, whose sum is σ = 36401045562. Its totient is φ = 36401045560.
The previous prime is 36401045503. The next prime is 36401045563. The reversal of 36401045561 is 16554010463.
36401045561 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., 31770923536 + 4630122025 = 178244^2 + 68045^2 .
It is a cyclic number.
It is not a de Polignac number, because 36401045561 - 26 = 36401045497 is a prime.
It is a super-2 number, since 2×364010455612 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 36401045563, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (36401045563) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 18200522780 + 18200522781.
It is an arithmetic number, because the mean of its divisors is an integer number (18200522781).
Almost surely, 236401045561 is an apocalyptic number.
It is an amenable number.
36401045561 is a deficient number, since it is larger than the sum of its proper divisors (1).
36401045561 is an equidigital number, since it uses as much as digits as its factorization.
36401045561 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 43200, while the sum is 35.
The spelling of 36401045561 in words is "thirty-six billion, four hundred one million, forty-five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •