Base | Representation |
---|---|
bin | 10110110000101110000110… |
… | …100110101010011010111001 |
3 | 111010102221122211012212000020 |
4 | 112300232012212222122321 |
5 | 101110110131112100131 |
6 | 552523344041401053 |
7 | 30041231506264545 |
oct | 2660560646523271 |
9 | 433387584185006 |
10 | 100105061050041 |
11 | 29995355258063 |
12 | b289046499189 |
13 | 43b1b3633b148 |
14 | 1aa117a0a6a25 |
15 | b88e67ebe996 |
hex | 5b0b869aa6b9 |
100105061050041 has 8 divisors (see below), whose sum is σ = 133634420062080. Its totient is φ = 66656204702352.
The previous prime is 100105061050037. The next prime is 100105061050061. The reversal of 100105061050041 is 140050160501001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100105061050041 - 22 = 100105061050037 is a prime.
It is a super-2 number, since 2×1001050610500412 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 100105061049993 and 100105061050020.
It is not an unprimeable number, because it can be changed into a prime (100105061050021) 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, 20125663185 + ... + 20125668158.
It is an arithmetic number, because the mean of its divisors is an integer number (16704302507760).
Almost surely, 2100105061050041 is an apocalyptic number.
It is an amenable number.
100105061050041 is a deficient number, since it is larger than the sum of its proper divisors (33529359012039).
100105061050041 is an equidigital number, since it uses as much as digits as its factorization.
100105061050041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40251332175.
The product of its (nonzero) digits is 600, while the sum is 24.
The spelling of 100105061050041 in words is "one hundred trillion, one hundred five billion, sixty-one million, fifty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •