Base | Representation |
---|---|
bin | 10111001111010000010000… |
… | …101101101111010000011001 |
3 | 111101212112122020202100220212 |
4 | 113033100100231233100121 |
5 | 101343444400440413423 |
6 | 1001211320312100505 |
7 | 30345642412634000 |
oct | 2717202055572031 |
9 | 441775566670825 |
10 | 102203322201113 |
11 | 2a624204a47011 |
12 | b567831994735 |
13 | 4504969082a53 |
14 | 1b3494aa9bc37 |
15 | bc382270c578 |
hex | 5cf410b6f419 |
102203322201113 has 16 divisors (see below), whose sum is σ = 119269239600000. Its totient is φ = 87542804096496.
The previous prime is 102203322201089. The next prime is 102203322201161. The reversal of 102203322201113 is 311102223302201.
It is not a de Polignac number, because 102203322201113 - 26 = 102203322201049 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (102203322201163) 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 15 ways as a sum of consecutive naturals, for example, 101613638 + ... + 102614511.
It is an arithmetic number, because the mean of its divisors is an integer number (7454327475000).
Almost surely, 2102203322201113 is an apocalyptic number.
It is an amenable number.
102203322201113 is a deficient number, since it is larger than the sum of its proper divisors (17065917398887).
102203322201113 is an equidigital number, since it uses as much as digits as its factorization.
102203322201113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204229629 (or 204229615 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 102203322201113 its reverse (311102223302201), we get a palindrome (413305545503314).
The spelling of 102203322201113 in words is "one hundred two trillion, two hundred three billion, three hundred twenty-two million, two hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •