Base | Representation |
---|---|
bin | 10000010000011… |
… | …111111101000010 |
3 | 201000020200021000 |
4 | 100100133331002 |
5 | 1024311320032 |
6 | 43022112430 |
7 | 6521266350 |
oct | 2020377502 |
9 | 630220230 |
10 | 272760642 |
11 | 12aa6a120 |
12 | 7741b716 |
13 | 4468153b |
14 | 283227d0 |
15 | 18e2ce7c |
hex | 1041ff42 |
272760642 has 64 divisors (see below), whose sum is σ = 755712000. Its totient is φ = 70845840.
The previous prime is 272760641. The next prime is 272760671. The reversal of 272760642 is 246067272.
272760642 is a `hidden beast` number, since 2 + 7 + 2 + 7 + 6 + 0 + 642 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 272760597 and 272760606.
It is not an unprimeable number, because it can be changed into a prime (272760641) 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, 28642 + ... + 36957.
It is an arithmetic number, because the mean of its divisors is an integer number (11808000).
Almost surely, 2272760642 is an apocalyptic number.
272760642 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
272760642 is an abundant number, since it is smaller than the sum of its proper divisors (482951358).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
272760642 is a wasteful number, since it uses less digits than its factorization.
272760642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65628 (or 65622 counting only the distinct ones).
The product of its (nonzero) digits is 56448, while the sum is 36.
The square root of 272760642 is about 16515.4667508975. The cubic root of 272760642 is about 648.5257649979.
The spelling of 272760642 in words is "two hundred seventy-two million, seven hundred sixty thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •