Base | Representation |
---|---|
bin | 1100101000110… |
… | …01010110010001 |
3 | 21101110212101100 |
4 | 12110121112101 |
5 | 204114310001 |
6 | 14304055013 |
7 | 2425033026 |
oct | 624312621 |
9 | 241425340 |
10 | 106010001 |
11 | 54926979 |
12 | 2b604469 |
13 | 18c69216 |
14 | 1011754d |
15 | 9490586 |
hex | 6519591 |
106010001 has 6 divisors (see below), whose sum is σ = 153125570. Its totient is φ = 70673328.
The previous prime is 106009999. The next prime is 106010081. The reversal of 106010001 is 100010601.
It can be written as a sum of positive squares in only one way, i.e., 81000000 + 25010001 = 9000^2 + 5001^2 .
It is not a de Polignac number, because 106010001 - 21 = 106009999 is a prime.
It is a super-2 number, since 2×1060100012 = 22476240624040002, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 11778889 = 106010001 / (1 + 0 + 6 + 0 + 1 + 0 + 0 + 0 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106010081) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5889436 + ... + 5889453.
Almost surely, 2106010001 is an apocalyptic number.
It is an amenable number.
106010001 is a deficient number, since it is larger than the sum of its proper divisors (47115569).
106010001 is a wasteful number, since it uses less digits than its factorization.
106010001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11778895 (or 11778892 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 106010001 is about 10296.1158210269. The cubic root of 106010001 is about 473.2772326003.
Adding to 106010001 its reverse (100010601), we get a palindrome (206020602).
The spelling of 106010001 in words is "one hundred six million, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •