Base | Representation |
---|---|
bin | 11001101011100101… |
… | …000000001100000110 |
3 | 2122011201121011120120 |
4 | 121223211000030012 |
5 | 422433103302430 |
6 | 20400112442410 |
7 | 1664216536134 |
oct | 315345001406 |
9 | 78151534516 |
10 | 27574665990 |
11 | 107701a8763 |
12 | 5416849406 |
13 | 27a5a79211 |
14 | 14982b2754 |
15 | ab5c4b610 |
hex | 66b940306 |
27574665990 has 128 divisors (see below), whose sum is σ = 70352064000. Its totient is φ = 6897623040.
The previous prime is 27574665973. The next prime is 27574666069. The reversal of 27574665990 is 9956647572.
It is a Smith number, since the sum of its digits (60) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 41716260 + ... + 41716920.
It is an arithmetic number, because the mean of its divisors is an integer number (549625500).
Almost surely, 227574665990 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27574665990, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35176032000).
27574665990 is an abundant number, since it is smaller than the sum of its proper divisors (42777398010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27574665990 is a wasteful number, since it uses less digits than its factorization.
With its predecessor (27574665989) it forms an eRAP, since the sums of their prime factors are consecutive (1301 and 1302).
27574665990 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1302.
The product of its (nonzero) digits is 28576800, while the sum is 60.
The spelling of 27574665990 in words is "twenty-seven billion, five hundred seventy-four million, six hundred sixty-five thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •