Base | Representation |
---|---|
bin | 1100000101101… |
… | …11011010100001 |
3 | 21001211101121212 |
4 | 12002313122201 |
5 | 201430231221 |
6 | 14021355505 |
7 | 2341003163 |
oct | 602673241 |
9 | 231741555 |
10 | 101414561 |
11 | 52278296 |
12 | 29b68b95 |
13 | 1801a621 |
14 | d67c933 |
15 | 8d83b5b |
hex | 60b76a1 |
101414561 has 2 divisors, whose sum is σ = 101414562. Its totient is φ = 101414560.
The previous prime is 101414557. The next prime is 101414563. The reversal of 101414561 is 165414101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100500625 + 913936 = 10025^2 + 956^2 .
It is a cyclic number.
It is not a de Polignac number, because 101414561 - 22 = 101414557 is a prime.
Together with 101414563, it forms a pair of twin primes.
It is a Chen prime.
It is an alternating number because its digits alternate between odd and even.
It is not a weakly prime, because it can be changed into another prime (101414563) 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, 50707280 + 50707281.
It is an arithmetic number, because the mean of its divisors is an integer number (50707281).
Almost surely, 2101414561 is an apocalyptic number.
It is an amenable number.
101414561 is a deficient number, since it is larger than the sum of its proper divisors (1).
101414561 is an equidigital number, since it uses as much as digits as its factorization.
101414561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 23.
The square root of 101414561 is about 10070.4796807302. The cubic root of 101414561 is about 466.3372475070.
Adding to 101414561 its reverse (165414101), we get a palindrome (266828662).
The spelling of 101414561 in words is "one hundred one million, four hundred fourteen thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •