Base | Representation |
---|---|
bin | 1100000101111… |
… | …10101000101001 |
3 | 21001212220012021 |
4 | 12002332220221 |
5 | 201432203022 |
6 | 14022144441 |
7 | 2341155334 |
oct | 602765051 |
9 | 231786167 |
10 | 101444137 |
11 | 52298533 |
12 | 29b82121 |
13 | 1802ac22 |
14 | d68961b |
15 | 8d8c7c7 |
hex | 60bea29 |
101444137 has 8 divisors (see below), whose sum is σ = 103395200. Its totient is φ = 99509904.
The previous prime is 101444131. The next prime is 101444143. The reversal of 101444137 is 731444101.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (101444131) and next prime (101444143).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101444137 - 23 = 101444129 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101444131) 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 in 7 ways as a sum of consecutive naturals, for example, 8314 + ... + 16492.
It is an arithmetic number, because the mean of its divisors is an integer number (12924400).
Almost surely, 2101444137 is an apocalyptic number.
It is an amenable number.
101444137 is a deficient number, since it is larger than the sum of its proper divisors (1951063).
101444137 is an equidigital number, since it uses as much as digits as its factorization.
101444137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8415.
The product of its (nonzero) digits is 1344, while the sum is 25.
The square root of 101444137 is about 10071.9480240915. The cubic root of 101444137 is about 466.3825764674.
Adding to 101444137 its reverse (731444101), we get a palindrome (832888238).
The spelling of 101444137 in words is "one hundred one million, four hundred forty-four thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •