Base | Representation |
---|---|
bin | 1001001100100000101111… |
… | …00000001001001111100011 |
3 | 2122121010012020202010011001 |
4 | 10212100113200021033203 |
5 | 10122300303141111003 |
6 | 111001240101332431 |
7 | 4154632500600544 |
oct | 446202740111743 |
9 | 78533166663131 |
10 | 20221100332003 |
11 | 64967a1a79a4a |
12 | 2326b99707117 |
13 | b38ac2c4665c |
14 | 4dc9c680c4cb |
15 | 250ee597561d |
hex | 1264178093e3 |
20221100332003 has 4 divisors (see below), whose sum is σ = 20498101706488. Its totient is φ = 19944098957520.
The previous prime is 20221100331983. The next prime is 20221100332231. The reversal of 20221100332003 is 30023300112202.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20221100332003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20221100339003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 138500687133 + ... + 138500687278.
It is an arithmetic number, because the mean of its divisors is an integer number (5124525426622).
Almost surely, 220221100332003 is an apocalyptic number.
20221100332003 is a deficient number, since it is larger than the sum of its proper divisors (277001374485).
20221100332003 is an equidigital number, since it uses as much as digits as its factorization.
20221100332003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277001374484.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 20221100332003 its reverse (30023300112202), we get a palindrome (50244400444205).
The spelling of 20221100332003 in words is "twenty trillion, two hundred twenty-one billion, one hundred million, three hundred thirty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •