Base | Representation |
---|---|
bin | 110011100110… |
… | …0000001010110 |
3 | 1212220021201110 |
4 | 1213030001112 |
5 | 23411100240 |
6 | 2403435450 |
7 | 445631115 |
oct | 147140126 |
9 | 55807643 |
10 | 27050070 |
11 | 142a6133 |
12 | 9085b86 |
13 | 57b1378 |
14 | 3841c7c |
15 | 2594c80 |
hex | 19cc056 |
27050070 has 64 divisors (see below), whose sum is σ = 68428800. Its totient is φ = 6830208.
The previous prime is 27050039. The next prime is 27050137. The reversal of 27050070 is 7005072.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 135831 + ... + 136029.
It is an arithmetic number, because the mean of its divisors is an integer number (1069200).
Almost surely, 227050070 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 27050070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34214400).
27050070 is an abundant number, since it is smaller than the sum of its proper divisors (41378730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
27050070 is a wasteful number, since it uses less digits than its factorization.
27050070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 429.
The product of its (nonzero) digits is 490, while the sum is 21.
The square root of 27050070 is about 5200.9681790990. The cubic root of 27050070 is about 300.1853299303.
The spelling of 27050070 in words is "twenty-seven million, fifty thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •