Base | Representation |
---|---|
bin | 1100000101101… |
… | …10110101000001 |
3 | 21001211021022222 |
4 | 12002312311001 |
5 | 201430142121 |
6 | 14021340425 |
7 | 2340663164 |
oct | 602666501 |
9 | 231737288 |
10 | 101412161 |
11 | 52276504 |
12 | 29b67715 |
13 | 180194c6 |
14 | d67badb |
15 | 8d830ab |
hex | 60b6d41 |
101412161 has 4 divisors (see below), whose sum is σ = 103325652. Its totient is φ = 99498672.
The previous prime is 101412151. The next prime is 101412173. The reversal of 101412161 is 161214101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 77986561 + 23425600 = 8831^2 + 4840^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101412161 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101412121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 956666 + ... + 956771.
It is an arithmetic number, because the mean of its divisors is an integer number (25831413).
Almost surely, 2101412161 is an apocalyptic number.
It is an amenable number.
101412161 is a deficient number, since it is larger than the sum of its proper divisors (1913491).
101412161 is an equidigital number, since it uses as much as digits as its factorization.
101412161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1913490.
The product of its (nonzero) digits is 48, while the sum is 17.
The square root of 101412161 is about 10070.3605198622. The cubic root of 101412161 is about 466.3335688169. Note that the first 3 decimals are identical.
Adding to 101412161 its reverse (161214101), we get a palindrome (262626262).
The spelling of 101412161 in words is "one hundred one million, four hundred twelve thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •