Base | Representation |
---|---|
bin | 11001110011000000… |
… | …000010111001010000 |
3 | 2122111101220220220121 |
4 | 121303000002321100 |
5 | 423211443223342 |
6 | 20420321520024 |
7 | 2000261163634 |
oct | 316300027120 |
9 | 78441826817 |
10 | 27699195472 |
11 | 10824523593 |
12 | 54504a3014 |
13 | 27c57ca9c0 |
14 | 14aaa4adc4 |
15 | ac1b49067 |
hex | 673002e50 |
27699195472 has 20 divisors (see below), whose sum is σ = 57795437140. Its totient is φ = 12784243968.
The previous prime is 27699195439. The next prime is 27699195473. The reversal of 27699195472 is 27459199672.
It can be written as a sum of positive squares in 2 ways, for example, as 4456363536 + 23242831936 = 66756^2 + 152456^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 27699195472.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (27699195473) 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 3 ways as a sum of consecutive naturals, for example, 66584397 + ... + 66584812.
It is an arithmetic number, because the mean of its divisors is an integer number (2889771857).
Almost surely, 227699195472 is an apocalyptic number.
It is an amenable number.
27699195472 is an abundant number, since it is smaller than the sum of its proper divisors (30096241668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27699195472 is a wasteful number, since it uses less digits than its factorization.
27699195472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133169230 (or 133169224 counting only the distinct ones).
The product of its digits is 17146080, while the sum is 61.
The spelling of 27699195472 in words is "twenty-seven billion, six hundred ninety-nine million, one hundred ninety-five thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •