Base | Representation |
---|---|
bin | 10000001000000… |
… | …011000100010100 |
3 | 200212002010012120 |
4 | 100020003010110 |
5 | 1023224421142 |
6 | 42502415540 |
7 | 6463411302 |
oct | 2010030424 |
9 | 625063176 |
10 | 270545172 |
11 | 129796657 |
12 | 767315b0 |
13 | 44087001 |
14 | 27d07272 |
15 | 18b417ec |
hex | 10203114 |
270545172 has 12 divisors (see below), whose sum is σ = 631272096. Its totient is φ = 90181720.
The previous prime is 270545141. The next prime is 270545203. The reversal of 270545172 is 271545072.
It is an interprime number because it is at equal distance from previous prime (270545141) and next prime (270545203).
It is a tau number, because it is divible by the number of its divisors (12).
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11272704 + ... + 11272727.
It is an arithmetic number, because the mean of its divisors is an integer number (52606008).
Almost surely, 2270545172 is an apocalyptic number.
It is an amenable number.
270545172 is an abundant number, since it is smaller than the sum of its proper divisors (360726924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
270545172 is a wasteful number, since it uses less digits than its factorization.
270545172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22545438 (or 22545436 counting only the distinct ones).
The product of its (nonzero) digits is 19600, while the sum is 33.
The square root of 270545172 is about 16448.2574153009. The cubic root of 270545172 is about 646.7651284280.
The spelling of 270545172 in words is "two hundred seventy million, five hundred forty-five thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.153 sec. • engine limits •