Base | Representation |
---|---|
bin | 1001100110000101110101… |
… | …01010101110111001111111 |
3 | 2202201010211001110100022122 |
4 | 10303002322222232321333 |
5 | 10231200310321403203 |
6 | 112513113350033155 |
7 | 4305265642211651 |
oct | 463027252567177 |
9 | 82633731410278 |
10 | 21100011122303 |
11 | 67a5512225413 |
12 | 24493a70487bb |
13 | ba0951484649 |
14 | 52d362dbc6d1 |
15 | 268cd67d2538 |
hex | 1330baaaee7f |
21100011122303 has 8 divisors (see below), whose sum is σ = 21305127900240. Its totient is φ = 20895041018880.
The previous prime is 21100011122291. The next prime is 21100011122317. The reversal of 21100011122303 is 30322111000112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21100011122303 is a prime.
It is a super-2 number, since 2×211000111223032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21100011122903) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 36379508 + ... + 36954953.
It is an arithmetic number, because the mean of its divisors is an integer number (2663140987530).
Almost surely, 221100011122303 is an apocalyptic number.
21100011122303 is a deficient number, since it is larger than the sum of its proper divisors (205116777937).
21100011122303 is a wasteful number, since it uses less digits than its factorization.
21100011122303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73337257.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 21100011122303 its reverse (30322111000112), we get a palindrome (51422122122415).
The spelling of 21100011122303 in words is "twenty-one trillion, one hundred billion, eleven million, one hundred twenty-two thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •