Base | Representation |
---|---|
bin | 1100000111001… |
… | …10000011111111 |
3 | 21002012002201112 |
4 | 12003212003333 |
5 | 202002340011 |
6 | 14025432235 |
7 | 2342430221 |
oct | 603460377 |
9 | 232162645 |
10 | 101605631 |
11 | 523988a6 |
12 | 2a03b67b |
13 | 1808659a |
14 | d6cc411 |
15 | 8dc058b |
hex | 60e60ff |
101605631 has 4 divisors (see below), whose sum is σ = 104883264. Its totient is φ = 98328000.
The previous prime is 101605627. The next prime is 101605643. The reversal of 101605631 is 136506101.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 136506101 = 11503 ⋅11867.
It is a cyclic number.
It is not a de Polignac number, because 101605631 - 22 = 101605627 is a prime.
It is a super-2 number, since 2×1016056312 = 20647408501816322, which contains 22 as substring.
It is a Duffinian number.
It is a zygodrome in base 2.
It is a junction number, because it is equal to n+sod(n) for n = 101605597 and 101605606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101605601) 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, 1638770 + ... + 1638831.
It is an arithmetic number, because the mean of its divisors is an integer number (26220816).
Almost surely, 2101605631 is an apocalyptic number.
101605631 is a deficient number, since it is larger than the sum of its proper divisors (3277633).
101605631 is an equidigital number, since it uses as much as digits as its factorization.
101605631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3277632.
The product of its (nonzero) digits is 540, while the sum is 23.
The square root of 101605631 is about 10079.9618550866. The cubic root of 101605631 is about 466.6299311786.
The spelling of 101605631 in words is "one hundred one million, six hundred five thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •