Base | Representation |
---|---|
bin | 1100000100010… |
… | …11010111010101 |
3 | 21001111020010100 |
4 | 12002023113111 |
5 | 201403443013 |
6 | 14013444313 |
7 | 2336322150 |
oct | 602132725 |
9 | 231436110 |
10 | 101234133 |
11 | 52164780 |
12 | 29aa0699 |
13 | 17c86470 |
14 | d632c97 |
15 | 8d4a473 |
hex | 608b5d5 |
101234133 has 96 divisors (see below), whose sum is σ = 208196352. Its totient is φ = 45619200.
The previous prime is 101234131. The next prime is 101234153. The reversal of 101234133 is 331432101.
It is not a de Polignac number, because 101234133 - 21 = 101234131 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101234131) 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 95 ways as a sum of consecutive naturals, for example, 152823 + ... + 153483.
It is an arithmetic number, because the mean of its divisors is an integer number (2168712).
Almost surely, 2101234133 is an apocalyptic number.
101234133 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
101234133 is an abundant number, since it is smaller than the sum of its proper divisors (106962219).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101234133 is a wasteful number, since it uses less digits than its factorization.
101234133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 715 (or 712 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
The square root of 101234133 is about 10061.5174302885. The cubic root of 101234133 is about 466.0605277282.
Adding to 101234133 its reverse (331432101), we get a palindrome (432666234).
The spelling of 101234133 in words is "one hundred one million, two hundred thirty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •