Base | Representation |
---|---|
bin | 100000001011001111110… |
… | …110010001101111110011 |
3 | 21211101020101022022121202 |
4 | 200023033312101233303 |
5 | 242211313134133243 |
6 | 4411433201041415 |
7 | 315514061316353 |
oct | 40131766215763 |
9 | 7741211268552 |
10 | 2211100302323 |
11 | 7827a4528460 |
12 | 2b863902626b |
13 | 1306764c9173 |
14 | 79036cb0b63 |
15 | 3c7b0c054b8 |
hex | 202cfd91bf3 |
2211100302323 has 8 divisors (see below), whose sum is σ = 2418473830080. Its totient is φ = 2004787509480.
The previous prime is 2211100302317. The next prime is 2211100302343. The reversal of 2211100302323 is 3232030011122.
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 2211100302323 - 220 = 2211099253747 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2211100302295 and 2211100302304.
It is not an unprimeable number, because it can be changed into a prime (2211100302343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 265179365 + ... + 265187702.
It is an arithmetic number, because the mean of its divisors is an integer number (302309228760).
Almost surely, 22211100302323 is an apocalyptic number.
2211100302323 is a deficient number, since it is larger than the sum of its proper divisors (207373527757).
2211100302323 is a wasteful number, since it uses less digits than its factorization.
2211100302323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 530367457.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2211100302323 its reverse (3232030011122), we get a palindrome (5443130313445).
The spelling of 2211100302323 in words is "two trillion, two hundred eleven billion, one hundred million, three hundred two thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •