Base | Representation |
---|---|
bin | 1100000010100… |
… | …10011100101101 |
3 | 21001001101022222 |
4 | 12001102130231 |
5 | 201324013010 |
6 | 14004445125 |
7 | 2334331400 |
oct | 601223455 |
9 | 231041288 |
10 | 101001005 |
11 | 52015606 |
12 | 299a97a5 |
13 | 17c04311 |
14 | d5b1d37 |
15 | 8d01355 |
hex | 605272d |
101001005 has 12 divisors (see below), whose sum is σ = 140989500. Its totient is φ = 69257664.
The previous prime is 101001001. The next prime is 101001011. The reversal of 101001005 is 500100101.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 13147876 + 87853129 = 3626^2 + 9373^2 .
It is not a de Polignac number, because 101001005 - 22 = 101001001 is a prime.
It is a super-2 number, since 2×1010010052 = 20402406022020050, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101000983 and 101001001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101001001) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 205880 + ... + 206369.
It is an arithmetic number, because the mean of its divisors is an integer number (11749125).
Almost surely, 2101001005 is an apocalyptic number.
It is an amenable number.
101001005 is a deficient number, since it is larger than the sum of its proper divisors (39988495).
101001005 is an equidigital number, since it uses as much as digits as its factorization.
101001005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 412268 (or 412261 counting only the distinct ones).
The product of its (nonzero) digits is 5, while the sum is 8.
The square root of 101001005 is about 10049.9256216153. The cubic root of 101001005 is about 465.7024954269.
Adding to 101001005 its reverse (500100101), we get a palindrome (601101106).
The spelling of 101001005 in words is "one hundred one million, one thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •