Base | Representation |
---|---|
bin | 101110100100010000… |
… | …1100100000111101101 |
3 | 100120010020112110022020 |
4 | 1131020201210013231 |
5 | 3114300224143221 |
6 | 113535000340353 |
7 | 10140055345425 |
oct | 1351041440755 |
9 | 316106473266 |
10 | 100001006061 |
11 | 39456a62a60 |
12 | 1746a1746b9 |
13 | 9578aa2648 |
14 | 4ba9243485 |
15 | 2904387ac6 |
hex | 17488641ed |
100001006061 has 16 divisors (see below), whose sum is σ = 146021997888. Its totient is φ = 60370841600.
The previous prime is 100001006051. The next prime is 100001006069. The reversal of 100001006061 is 160600100001.
It is a cyclic number.
It is not a de Polignac number, because 100001006061 - 25 = 100001006029 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 100001006061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100001006069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5887110 + ... + 5904071.
It is an arithmetic number, because the mean of its divisors is an integer number (9126374868).
Almost surely, 2100001006061 is an apocalyptic number.
100001006061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100001006061 is a deficient number, since it is larger than the sum of its proper divisors (46020991827).
100001006061 is a wasteful number, since it uses less digits than its factorization.
100001006061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11791452.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 100001006061 its reverse (160600100001), we get a palindrome (260601106062).
The spelling of 100001006061 in words is "one hundred billion, one million, six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •