Base | Representation |
---|---|
bin | 101110110111011000… |
… | …1010010011011110101 |
3 | 100121202221220221221221 |
4 | 1131232301102123311 |
5 | 3122104010142013 |
6 | 114122401310341 |
7 | 10162006341016 |
oct | 1355661223365 |
9 | 317687827857 |
10 | 100642662133 |
11 | 39756182732 |
12 | 176090353b1 |
13 | 964b9c47b0 |
14 | 4c2a55100d |
15 | 294088308d |
hex | 176ec526f5 |
100642662133 has 4 divisors (see below), whose sum is σ = 108384405388. Its totient is φ = 92900918880.
The previous prime is 100642662077. The next prime is 100642662143. The reversal of 100642662133 is 331266246001.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 45259158564 + 55383503569 = 212742^2 + 235337^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100642662133 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100642662143) 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, 3870871608 + ... + 3870871633.
It is an arithmetic number, because the mean of its divisors is an integer number (27096101347).
Almost surely, 2100642662133 is an apocalyptic number.
100642662133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
100642662133 is a deficient number, since it is larger than the sum of its proper divisors (7741743255).
100642662133 is an equidigital number, since it uses as much as digits as its factorization.
100642662133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7741743254.
The product of its (nonzero) digits is 31104, while the sum is 34.
The spelling of 100642662133 in words is "one hundred billion, six hundred forty-two million, six hundred sixty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •