Base | Representation |
---|---|
bin | 101110110011001000… |
… | …1000111010001001101 |
3 | 100121102000111111002212 |
4 | 1131212101013101031 |
5 | 3121311000310221 |
6 | 114100304000205 |
7 | 10155324663533 |
oct | 1354621072115 |
9 | 317360444085 |
10 | 100500010061 |
11 | 396926aa060 |
12 | 17589300065 |
13 | 9628299299 |
14 | 4c1561a153 |
15 | 29330a5b5b |
hex | 176644744d |
100500010061 has 8 divisors (see below), whose sum is σ = 109639783200. Its totient is φ = 91360805040.
The previous prime is 100500010043. The next prime is 100500010063. The reversal of 100500010061 is 160010005001.
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 100500010061 - 26 = 100500009997 is a prime.
It is a super-2 number, since 2×1005000100612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100500010063) 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, 283235 + ... + 530303.
It is an arithmetic number, because the mean of its divisors is an integer number (13704972900).
Almost surely, 2100500010061 is an apocalyptic number.
100500010061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
100500010061 is a deficient number, since it is larger than the sum of its proper divisors (9139773139).
100500010061 is a wasteful number, since it uses less digits than its factorization.
100500010061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 284059.
The product of its (nonzero) digits is 30, while the sum is 14.
Adding to 100500010061 its reverse (160010005001), we get a palindrome (260510015062).
The spelling of 100500010061 in words is "one hundred billion, five hundred million, ten thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •