Base | Representation |
---|---|
bin | 10000000101111… |
… | …110001110110000 |
3 | 200211001110211201 |
4 | 100011332032300 |
5 | 1023110013242 |
6 | 42443020544 |
7 | 6455654065 |
oct | 2005761660 |
9 | 624043751 |
10 | 270001072 |
11 | 129454890 |
12 | 7650a754 |
13 | 43c26463 |
14 | 27c04c6c |
15 | 18a854b7 |
hex | 1017e3b0 |
270001072 has 160 divisors (see below), whose sum is σ = 647958528. Its totient is φ = 107520000.
The previous prime is 270001033. The next prime is 270001073. The reversal of 270001072 is 270100072.
It is a super-2 number, since 2×2700010722 = 145801157762298368, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (270001073) 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 31 ways as a sum of consecutive naturals, for example, 3802797 + ... + 3802867.
Almost surely, 2270001072 is an apocalyptic number.
270001072 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 270001072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (323979264).
270001072 is an abundant number, since it is smaller than the sum of its proper divisors (377957456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
270001072 is a wasteful number, since it uses less digits than its factorization.
270001072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179 (or 173 counting only the distinct ones).
The product of its (nonzero) digits is 196, while the sum is 19.
The square root of 270001072 is about 16431.7093450438. The cubic root of 270001072 is about 646.3312623988.
The spelling of 270001072 in words is "two hundred seventy million, one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •