Base | Representation |
---|---|
bin | 10110110000101110100000… |
… | …110100111101011100100001 |
3 | 111010102222210111001220120121 |
4 | 112300232200310331130201 |
5 | 101110112031224134401 |
6 | 552523455435240241 |
7 | 30041245430661040 |
oct | 2660564064753441 |
9 | 433388714056517 |
10 | 100105501005601 |
11 | 299955606331a3 |
12 | b2891498a9081 |
13 | 43b1ba652bc90 |
14 | 1aa11bc6ac557 |
15 | b88e91926ca1 |
hex | 5b0ba0d3d721 |
100105501005601 has 32 divisors (see below), whose sum is σ = 126187605992448. Its totient is φ = 77291477847360.
The previous prime is 100105501005593. The next prime is 100105501005607. The reversal of 100105501005601 is 106500105501001.
It is not a de Polignac number, because 100105501005601 - 23 = 100105501005593 is a prime.
It is a super-2 number, since 2×1001055010056012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (100105501005607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7455391 + ... + 15993556.
It is an arithmetic number, because the mean of its divisors is an integer number (3943362687264).
Almost surely, 2100105501005601 is an apocalyptic number.
It is an amenable number.
100105501005601 is a deficient number, since it is larger than the sum of its proper divisors (26082104986847).
100105501005601 is a wasteful number, since it uses less digits than its factorization.
100105501005601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23450101.
The product of its (nonzero) digits is 750, while the sum is 25.
Adding to 100105501005601 its reverse (106500105501001), we get a palindrome (206605606506602).
The spelling of 100105501005601 in words is "one hundred trillion, one hundred five billion, five hundred one million, five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •