Base | Representation |
---|---|
bin | 11001001010101… |
… | …11101110011101 |
3 | 112201021011110010 |
4 | 30211113232131 |
5 | 413021414401 |
6 | 32541033433 |
7 | 5142342150 |
oct | 1445275635 |
9 | 481234403 |
10 | 211123101 |
11 | a919aa02 |
12 | 5a855879 |
13 | 34980117 |
14 | 20079c97 |
15 | 13804ed6 |
hex | c957b9d |
211123101 has 8 divisors (see below), whose sum is σ = 321711424. Its totient is φ = 120641760.
The previous prime is 211123067. The next prime is 211123123. The reversal of 211123101 is 101321112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211123101 - 26 = 211123037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211123001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5026720 + ... + 5026761.
It is an arithmetic number, because the mean of its divisors is an integer number (40213928).
Almost surely, 2211123101 is an apocalyptic number.
211123101 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
211123101 is a deficient number, since it is larger than the sum of its proper divisors (110588323).
211123101 is a wasteful number, since it uses less digits than its factorization.
211123101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10053491.
The product of its (nonzero) digits is 12, while the sum is 12.
The square root of 211123101 is about 14530.0757396512. The cubic root of 211123101 is about 595.4499348455.
Adding to 211123101 its reverse (101321112), we get a palindrome (312444213).
The spelling of 211123101 in words is "two hundred eleven million, one hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •