Base | Representation |
---|---|
bin | 1001010010111001001110… |
… | …0001100000000101100001 |
3 | 1100012001010110120120010201 |
4 | 2110232103201200011201 |
5 | 2314421433232330423 |
6 | 33423032431025201 |
7 | 2103246065411341 |
oct | 224562341400541 |
9 | 40161113516121 |
10 | 10220202230113 |
11 | 32903aa79a767 |
12 | 11908b106b201 |
13 | 5919b7a0a6c5 |
14 | 2749362d8d21 |
15 | 12acb6c7d2ad |
hex | 94b93860161 |
10220202230113 has 8 divisors (see below), whose sum is σ = 10443628040832. Its totient is φ = 9997025365296.
The previous prime is 10220202230059. The next prime is 10220202230159. The reversal of 10220202230113 is 31103220202201.
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 10220202230113 - 213 = 10220202221921 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10220202230713) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62153470 + ... + 62317687.
It is an arithmetic number, because the mean of its divisors is an integer number (1305453505104).
Almost surely, 210220202230113 is an apocalyptic number.
It is an amenable number.
10220202230113 is a deficient number, since it is larger than the sum of its proper divisors (223425810719).
10220202230113 is a wasteful number, since it uses less digits than its factorization.
10220202230113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124472951.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 10220202230113 its reverse (31103220202201), we get a palindrome (41323422432314).
The spelling of 10220202230113 in words is "ten trillion, two hundred twenty billion, two hundred two million, two hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •