Base | Representation |
---|---|
bin | 1100000101110… |
… | …00000000000001 |
3 | 21001211111220202 |
4 | 12002320000001 |
5 | 201430320321 |
6 | 14021414545 |
7 | 2341013162 |
oct | 602700001 |
9 | 231744822 |
10 | 101416961 |
11 | 5227a078 |
12 | 29b6a455 |
13 | 1801b749 |
14 | d67d769 |
15 | 8d8470b |
hex | 60b8001 |
101416961 has 4 divisors (see below), whose sum is σ = 102700800. Its totient is φ = 100133124.
The previous prime is 101416949. The next prime is 101416981. The reversal of 101416961 is 169614101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 101416961 - 218 = 101154817 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 (101416901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 641801 + ... + 641958.
It is an arithmetic number, because the mean of its divisors is an integer number (25675200).
It is a Proth number, since it is equal to 3095 ⋅ 215 + 1 and 3095 < 215.
Almost surely, 2101416961 is an apocalyptic number.
It is an amenable number.
101416961 is a deficient number, since it is larger than the sum of its proper divisors (1283839).
101416961 is an equidigital number, since it uses as much as digits as its factorization.
101416961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1283838.
The product of its (nonzero) digits is 1296, while the sum is 29.
The square root of 101416961 is about 10070.5988401882. The cubic root of 101416961 is about 466.3409261390.
The spelling of 101416961 in words is "one hundred one million, four hundred sixteen thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •