Base | Representation |
---|---|
bin | 1011111100000… |
… | …00110000110101 |
3 | 20222102202011220 |
4 | 11332000300311 |
5 | 201114022013 |
6 | 13534220553 |
7 | 2324123400 |
oct | 576006065 |
9 | 228382156 |
10 | 100142133 |
11 | 515892a3 |
12 | 29654759 |
13 | 17993400 |
14 | d42ad37 |
15 | 8bd1b23 |
hex | 5f80c35 |
100142133 has 72 divisors (see below), whose sum is σ = 175240800. Its totient is φ = 50633856.
The previous prime is 100142129. The next prime is 100142149. The reversal of 100142133 is 331241001.
It is not a de Polignac number, because 100142133 - 22 = 100142129 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100142113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 720378 + ... + 720516.
It is an arithmetic number, because the mean of its divisors is an integer number (2433900).
Almost surely, 2100142133 is an apocalyptic number.
100142133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
100142133 is a deficient number, since it is larger than the sum of its proper divisors (75098667).
100142133 is a wasteful number, since it uses less digits than its factorization.
100142133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211 (or 191 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 100142133 is about 10007.1041265693. The cubic root of 100142133 is about 464.3786869049.
Adding to 100142133 its reverse (331241001), we get a palindrome (431383134).
It can be divided in two parts, 1001 and 42133, that added together give a palindrome (43134).
The spelling of 100142133 in words is "one hundred million, one hundred forty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •