Base | Representation |
---|---|
bin | 1001100110001000000101… |
… | …01110010100110000000111 |
3 | 2202201020221022012212201202 |
4 | 10303010002232110300013 |
5 | 10231210244311221203 |
6 | 112513433333013115 |
7 | 4305340621541450 |
oct | 463040256246007 |
9 | 82636838185652 |
10 | 21101220023303 |
11 | 67a5a82660652 |
12 | 2449683a8419b |
13 | ba0ab4a74394 |
14 | 52d439788127 |
15 | 268d579ca388 |
hex | 133102b94c07 |
21101220023303 has 8 divisors (see below), whose sum is σ = 24116763033600. Its totient is φ = 18085947764760.
The previous prime is 21101220023293. The next prime is 21101220023341. The reversal of 21101220023303 is 30332002210112.
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 21101220023303 - 26 = 21101220023239 is a prime.
It is a super-2 number, since 2×211012200233032 (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 (21101220023353) 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, 67520903 + ... + 67832696.
It is an arithmetic number, because the mean of its divisors is an integer number (3014595379200).
Almost surely, 221101220023303 is an apocalyptic number.
21101220023303 is a deficient number, since it is larger than the sum of its proper divisors (3015543010297).
21101220023303 is a wasteful number, since it uses less digits than its factorization.
21101220023303 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 135375877.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 21101220023303 its reverse (30332002210112), we get a palindrome (51433222233415).
The spelling of 21101220023303 in words is "twenty-one trillion, one hundred one billion, two hundred twenty million, twenty-three thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •