Base | Representation |
---|---|
bin | 10110110000101110100000… |
… | …110001001001011001110001 |
3 | 111010102222210102012010101101 |
4 | 112300232200301021121301 |
5 | 101110112031000143001 |
6 | 552523455402004401 |
7 | 30041245416325540 |
oct | 2660564061113161 |
9 | 433388712163341 |
10 | 100105500006001 |
11 | 29995560010186 |
12 | b2891494a6701 |
13 | 43b1ba626bcb9 |
14 | 1aa11bc4cc157 |
15 | b88e917caa01 |
hex | 5b0ba0c49671 |
100105500006001 has 16 divisors (see below), whose sum is σ = 114884624332800. Its totient is φ = 85446094482000.
The previous prime is 100105500005981. The next prime is 100105500006007. The reversal of 100105500006001 is 100600005501001.
It is not a de Polignac number, because 100105500006001 - 25 = 100105500005969 is a prime.
It is a super-2 number, since 2×1001055000060012 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 100105500006001.
It is not an unprimeable number, because it can be changed into a prime (100105500006007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3372040 + ... + 14545846.
It is an arithmetic number, because the mean of its divisors is an integer number (7180289020800).
Almost surely, 2100105500006001 is an apocalyptic number.
It is an amenable number.
100105500006001 is a deficient number, since it is larger than the sum of its proper divisors (14779124326799).
100105500006001 is a wasteful number, since it uses less digits than its factorization.
100105500006001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11179164.
The product of its (nonzero) digits is 150, while the sum is 19.
Adding to 100105500006001 its reverse (100600005501001), we get a palindrome (200705505507002).
The spelling of 100105500006001 in words is "one hundred trillion, one hundred five billion, five hundred million, six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.366 sec. • engine limits •