Base | Representation |
---|---|
bin | 10111001111100001101010… |
… | …001100011111001011001001 |
3 | 111101221022212011112200020112 |
4 | 113033201222030133023021 |
5 | 101344301130321144423 |
6 | 1001224050125004105 |
7 | 30350203351451141 |
oct | 2717415214371311 |
9 | 441838764480215 |
10 | 102222003303113 |
11 | 2a631120a40491 |
12 | b56b3860b3635 |
13 | 4506655436a65 |
14 | 1b357ddb43921 |
15 | bc40677a3a78 |
hex | 5cf86a31f2c9 |
102222003303113 has 4 divisors (see below), whose sum is σ = 102222602499840. Its totient is φ = 102221404106388.
The previous prime is 102222003303097. The next prime is 102222003303157. The reversal of 102222003303113 is 311303300222201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 102222003303113 - 24 = 102222003303097 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102222003305113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 299342393 + ... + 299683686.
It is an arithmetic number, because the mean of its divisors is an integer number (25555650624960).
Almost surely, 2102222003303113 is an apocalyptic number.
It is an amenable number.
102222003303113 is a deficient number, since it is larger than the sum of its proper divisors (599196727).
102222003303113 is an equidigital number, since it uses as much as digits as its factorization.
102222003303113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 599196726.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 102222003303113 its reverse (311303300222201), we get a palindrome (413525303525314).
The spelling of 102222003303113 in words is "one hundred two trillion, two hundred twenty-two billion, three million, three hundred three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •