Base | Representation |
---|---|
bin | 111110100101100… |
… | …0001110101111101 |
3 | 12102100121020121022 |
4 | 1331023001311331 |
5 | 13300102340013 |
6 | 544215113525 |
7 | 103020033506 |
oct | 17513016575 |
9 | 5370536538 |
10 | 2100043133 |
11 | 988468541 |
12 | 4a73728a5 |
13 | 276104696 |
14 | 15cc9bbad |
15 | c4575008 |
hex | 7d2c1d7d |
2100043133 has 8 divisors (see below), whose sum is σ = 2224827648. Its totient is φ = 1975397824.
The previous prime is 2100043117. The next prime is 2100043177. The reversal of 2100043133 is 3313400012.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2100043133 - 24 = 2100043117 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2100043193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2891 + ... + 64872.
It is an arithmetic number, because the mean of its divisors is an integer number (278103456).
Almost surely, 22100043133 is an apocalyptic number.
It is an amenable number.
2100043133 is a deficient number, since it is larger than the sum of its proper divisors (124784515).
2100043133 is a wasteful number, since it uses less digits than its factorization.
2100043133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69603.
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 2100043133 is about 45826.2275667548. The cubic root of 2100043133 is about 1280.5879324229.
Adding to 2100043133 its reverse (3313400012), we get a palindrome (5413443145).
The spelling of 2100043133 in words is "two billion, one hundred million, forty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •