Base | Representation |
---|---|
bin | 10010110100110011… |
… | …011001010100001101 |
3 | 1221011200210001001022 |
4 | 102310303121110031 |
5 | 312344042203401 |
6 | 13141423523525 |
7 | 1313621500034 |
oct | 226463312415 |
9 | 57150701038 |
10 | 20213241101 |
11 | 8632936239 |
12 | 3b014595a5 |
13 | 1ba1919ac1 |
14 | d9a75371b |
15 | 7d483d71b |
hex | 4b4cd950d |
20213241101 has 8 divisors (see below), whose sum is σ = 20256882240. Its totient is φ = 20169632448.
The previous prime is 20213241089. The next prime is 20213241107. The reversal of 20213241101 is 10114231202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20213241101 - 210 = 20213240077 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 20213241101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20213241107) 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, 1547285 + ... + 1560293.
It is an arithmetic number, because the mean of its divisors is an integer number (2532110280).
Almost surely, 220213241101 is an apocalyptic number.
It is an amenable number.
20213241101 is a deficient number, since it is larger than the sum of its proper divisors (43641139).
20213241101 is a wasteful number, since it uses less digits than its factorization.
20213241101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16243.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 20213241101 its reverse (10114231202), we get a palindrome (30327472303).
The spelling of 20213241101 in words is "twenty billion, two hundred thirteen million, two hundred forty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •