Base | Representation |
---|---|
bin | 10110110000101110100000… |
… | …110011010000110011011001 |
3 | 111010102222210110020022011010 |
4 | 112300232200303100303121 |
5 | 101110112031120414401 |
6 | 552523455421524133 |
7 | 30041245424125464 |
oct | 2660564063206331 |
9 | 433388713208133 |
10 | 100105500560601 |
11 | 29995560359928 |
12 | b289149713649 |
13 | 43b1ba6404573 |
14 | 1aa11bc5d42db |
15 | b88e91889ed6 |
hex | 5b0ba0cd0cd9 |
100105500560601 has 4 divisors (see below), whose sum is σ = 133474000747472. Its totient is φ = 66737000373732.
The previous prime is 100105500560537. The next prime is 100105500560677. The reversal of 100105500560601 is 106065005501001.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 100105500560601 - 26 = 100105500560537 is a prime.
It is a super-2 number, since 2×1001055005606012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100105500460601) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16684250093431 + ... + 16684250093436.
It is an arithmetic number, because the mean of its divisors is an integer number (33368500186868).
Almost surely, 2100105500560601 is an apocalyptic number.
It is an amenable number.
100105500560601 is a deficient number, since it is larger than the sum of its proper divisors (33368500186871).
100105500560601 is an equidigital number, since it uses as much as digits as its factorization.
100105500560601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33368500186870.
The product of its (nonzero) digits is 4500, while the sum is 30.
The spelling of 100105500560601 in words is "one hundred trillion, one hundred five billion, five hundred million, five hundred sixty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •