Base | Representation |
---|---|
bin | 1111110101110101010… |
… | …0101101110001011100 |
3 | 222000110111200220120101 |
4 | 3331131110231301130 |
5 | 13424330023313400 |
6 | 325005014030444 |
7 | 25443045236404 |
oct | 3753524556134 |
9 | 860414626511 |
10 | 272148651100 |
11 | a5465900687 |
12 | 448b2048424 |
13 | 1c881959ac1 |
14 | d25a209804 |
15 | 712c50c56a |
hex | 3f5d52dc5c |
272148651100 has 36 divisors (see below), whose sum is σ = 596409749208. Its totient is φ = 107781640000.
The previous prime is 272148651097. The next prime is 272148651101. The reversal of 272148651100 is 1156841272.
It is a self number, because there is not a number n which added to its sum of digits gives 272148651100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (272148651101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13462606 + ... + 13482805.
It is an arithmetic number, because the mean of its divisors is an integer number (16566937478).
Almost surely, 2272148651100 is an apocalyptic number.
272148651100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
272148651100 is an abundant number, since it is smaller than the sum of its proper divisors (324261098108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
272148651100 is a wasteful number, since it uses less digits than its factorization.
272148651100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26945526 (or 26945519 counting only the distinct ones).
The product of its (nonzero) digits is 26880, while the sum is 37.
The spelling of 272148651100 in words is "two hundred seventy-two billion, one hundred forty-eight million, six hundred fifty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •