Base | Representation |
---|---|
bin | 10111001111001111001001… |
… | …000100001000001111111111 |
3 | 111101212102112110210212102122 |
4 | 113033033021010020033333 |
5 | 101343434420222023403 |
6 | 1001211001131113155 |
7 | 30345600545222255 |
oct | 2717171104101777 |
9 | 441772473725378 |
10 | 102202120111103 |
11 | 2a623748442aa1 |
12 | b5675572a27bb |
13 | 450480700919c |
14 | 1b348751865d5 |
15 | bc37a1e0c838 |
hex | 5cf3c91083ff |
102202120111103 has 8 divisors (see below), whose sum is σ = 104365622351760. Its totient is φ = 100052993301120.
The previous prime is 102202120111093. The next prime is 102202120111141. The reversal of 102202120111103 is 301111021202201.
It is a happy number.
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 102202120111103 - 226 = 102202053002239 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102202120161103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3593843300 + ... + 3593871737.
It is an arithmetic number, because the mean of its divisors is an integer number (13045702793970).
Almost surely, 2102202120111103 is an apocalyptic number.
102202120111103 is a deficient number, since it is larger than the sum of its proper divisors (2163502240657).
102202120111103 is an equidigital number, since it uses as much as digits as its factorization.
102202120111103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7187715337.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 102202120111103 its reverse (301111021202201), we get a palindrome (403313141313304).
The spelling of 102202120111103 in words is "one hundred two trillion, two hundred two billion, one hundred twenty million, one hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •