Base | Representation |
---|---|
bin | 10111001111011111111001… |
… | …111100110000000111010011 |
3 | 111101221010222221000120101022 |
4 | 113033133321330300013103 |
5 | 101344233301223130003 |
6 | 1001223135214030055 |
7 | 30350105603653421 |
oct | 2717377174600723 |
9 | 441833887016338 |
10 | 102220120130003 |
11 | 2a630344a38677 |
12 | b56ab3b4a832b |
13 | 4506415245245 |
14 | 1b356a19ba111 |
15 | bc3ea72bb738 |
hex | 5cf7f9f301d3 |
102220120130003 has 4 divisors (see below), whose sum is σ = 102430017707760. Its totient is φ = 102010222552248.
The previous prime is 102220120129979. The next prime is 102220120130137. The reversal of 102220120130003 is 300031021022201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102220120130003 - 214 = 102220120113619 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102220120100003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 104948788148 + ... + 104948789121.
It is an arithmetic number, because the mean of its divisors is an integer number (25607504426940).
Almost surely, 2102220120130003 is an apocalyptic number.
102220120130003 is a deficient number, since it is larger than the sum of its proper divisors (209897577757).
102220120130003 is an equidigital number, since it uses as much as digits as its factorization.
102220120130003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209897577756.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 102220120130003 its reverse (300031021022201), we get a palindrome (402251141152204).
The spelling of 102220120130003 in words is "one hundred two trillion, two hundred twenty billion, one hundred twenty million, one hundred thirty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •