Base | Representation |
---|---|
bin | 1011111111100… |
… | …11011111011101 |
3 | 21000022121210122 |
4 | 11333303133131 |
5 | 201224041221 |
6 | 13552244325 |
7 | 2331121424 |
oct | 577633735 |
9 | 230277718 |
10 | 100612061 |
11 | 5187a370 |
12 | 298406a5 |
13 | 17ac9284 |
14 | d5102bb |
15 | 8c75eab |
hex | 5ff37dd |
100612061 has 8 divisors (see below), whose sum is σ = 110598048. Its totient is φ = 90766000.
The previous prime is 100612033. The next prime is 100612079. The reversal of 100612061 is 160216001.
It is a happy number.
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 100612061 - 210 = 100611037 is a prime.
It is a super-3 number, since 3×1006120613 (a number of 25 digits) contains 333 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100612021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33470 + ... + 36351.
It is an arithmetic number, because the mean of its divisors is an integer number (13824756).
Almost surely, 2100612061 is an apocalyptic number.
100612061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100612061 is a deficient number, since it is larger than the sum of its proper divisors (9985987).
100612061 is a wasteful number, since it uses less digits than its factorization.
100612061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69963.
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 100612061 is about 10030.5563654266. The cubic root of 100612061 is about 465.1039363765.
Adding to 100612061 its reverse (160216001), we get a palindrome (260828062).
The spelling of 100612061 in words is "one hundred million, six hundred twelve thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •