Base | Representation |
---|---|
bin | 1100101011100000001011… |
… | …00010100011000011110100 |
3 | 10122201120221122112002221120 |
4 | 12111300011202203003310 |
5 | 12123313411240100322 |
6 | 135145141032143540 |
7 | 5605324146545031 |
oct | 625600542430364 |
9 | 118646848462846 |
10 | 27883020628212 |
11 | 8980139265902 |
12 | 3163abb237bb0 |
13 | 12734857483b9 |
14 | 6c578c80a388 |
15 | 33547c111a5c |
hex | 195c058a30f4 |
27883020628212 has 24 divisors (see below), whose sum is σ = 65062890979296. Its totient is φ = 9293981707488.
The previous prime is 27883020628207. The next prime is 27883020628217. The reversal of 27883020628212 is 21282602038872.
It is an interprime number because it is at equal distance from previous prime (27883020628207) and next prime (27883020628217).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27883020628217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44488578 + ... + 45110969.
It is an arithmetic number, because the mean of its divisors is an integer number (2710953790804).
Almost surely, 227883020628212 is an apocalyptic number.
It is an amenable number.
27883020628212 is an abundant number, since it is smaller than the sum of its proper divisors (37179870351084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27883020628212 is a wasteful number, since it uses less digits than its factorization.
27883020628212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89625487 (or 89625485 counting only the distinct ones).
The product of its (nonzero) digits is 2064384, while the sum is 51.
The spelling of 27883020628212 in words is "twenty-seven trillion, eight hundred eighty-three billion, twenty million, six hundred twenty-eight thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.078 sec. • engine limits •