Base | Representation |
---|---|
bin | 101110000000000001000000… |
… | …011001110111011001011001 |
3 | 222112022202121202212200012120 |
4 | 232000001000121313121121 |
5 | 203004131334312024423 |
6 | 1554140254051531453 |
7 | 60420334426413102 |
oct | 5600010031673131 |
9 | 875282552780176 |
10 | 202311220033113 |
11 | 5950a785514374 |
12 | 1a83532a2b9b89 |
13 | 88b6b35028ca9 |
14 | 37d5cb58013a9 |
15 | 185c8a477eee3 |
hex | b80040677659 |
202311220033113 has 8 divisors (see below), whose sum is σ = 269748604562976. Its totient is φ = 134873991096000.
The previous prime is 202311220033073. The next prime is 202311220033129. The reversal of 202311220033113 is 311330022113202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 202311220033113 - 26 = 202311220033049 is a prime.
It is not an unprimeable number, because it can be changed into a prime (202311220033163) 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 7 ways as a sum of consecutive naturals, for example, 35829663 + ... + 41089988.
It is an arithmetic number, because the mean of its divisors is an integer number (33718575570372).
Almost surely, 2202311220033113 is an apocalyptic number.
It is an amenable number.
202311220033113 is a deficient number, since it is larger than the sum of its proper divisors (67437384529863).
202311220033113 is an equidigital number, since it uses as much as digits as its factorization.
202311220033113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77796375.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 202311220033113 its reverse (311330022113202), we get a palindrome (513641242146315).
The spelling of 202311220033113 in words is "two hundred two trillion, three hundred eleven billion, two hundred twenty million, thirty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •