Base | Representation |
---|---|
bin | 10110011001000100… |
… | …00000111000100101 |
3 | 1011000210101112222120 |
4 | 23030202000320211 |
5 | 144104434400143 |
6 | 5304512220153 |
7 | 603621145443 |
oct | 131442007045 |
9 | 34023345876 |
10 | 12021403173 |
11 | 510985014a |
12 | 23b5b3a659 |
13 | 1197719820 |
14 | 8207cdb93 |
15 | 4a559c383 |
hex | 2cc880e25 |
12021403173 has 16 divisors (see below), whose sum is σ = 17266126080. Its totient is φ = 7395804864.
The previous prime is 12021403133. The next prime is 12021403213. The reversal of 12021403173 is 37130412021.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (12021403133) and next prime (12021403213).
It is not a de Polignac number, because 12021403173 - 28 = 12021402917 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12021403133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 113515 + ... + 192167.
It is an arithmetic number, because the mean of its divisors is an integer number (1079132880).
Almost surely, 212021403173 is an apocalyptic number.
12021403173 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
12021403173 is a deficient number, since it is larger than the sum of its proper divisors (5244722907).
12021403173 is a wasteful number, since it uses less digits than its factorization.
12021403173 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82588.
The product of its (nonzero) digits is 1008, while the sum is 24.
Adding to 12021403173 its reverse (37130412021), we get a palindrome (49151815194).
The spelling of 12021403173 in words is "twelve billion, twenty-one million, four hundred three thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •