Base | Representation |
---|---|
bin | 10000001010000… |
… | …011001011110100 |
3 | 200220001210001102 |
4 | 100022003023310 |
5 | 1023343214230 |
6 | 42521545232 |
7 | 6501025241 |
oct | 2012031364 |
9 | 626053042 |
10 | 271069940 |
11 | 12a014949 |
12 | 76945218 |
13 | 4420bb1b |
14 | 280025c8 |
15 | 18be7045 |
hex | 102832f4 |
271069940 has 24 divisors (see below), whose sum is σ = 577745952. Its totient is φ = 106809120.
The previous prime is 271069933. The next prime is 271069963. The reversal of 271069940 is 49960172.
It is a Smith number, since the sum of its digits (38) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 271069894 and 271069903.
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 7 ways as a sum of consecutive naturals, for example, 99806 + ... + 102485.
It is an arithmetic number, because the mean of its divisors is an integer number (24072748).
Almost surely, 2271069940 is an apocalyptic number.
271069940 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
271069940 is an abundant number, since it is smaller than the sum of its proper divisors (306676012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
271069940 is a wasteful number, since it uses less digits than its factorization.
271069940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202367 (or 202365 counting only the distinct ones).
The product of its (nonzero) digits is 27216, while the sum is 38.
The square root of 271069940 is about 16464.2017723302. The cubic root of 271069940 is about 647.1830283722.
The spelling of 271069940 in words is "two hundred seventy-one million, sixty-nine thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •