Base | Representation |
---|---|
bin | 1111110101110111010… |
… | …0101010001101101100 |
3 | 222000111002110100120201 |
4 | 3331131310222031230 |
5 | 13424334144301012 |
6 | 325005513323244 |
7 | 25443206354446 |
oct | 3753564521554 |
9 | 860432410521 |
10 | 272157025132 |
11 | a546a600173 |
12 | 448b4a06524 |
13 | 1c8835cc555 |
14 | d25b389496 |
15 | 712d113857 |
hex | 3f5dd2a36c |
272157025132 has 24 divisors (see below), whose sum is σ = 479005954560. Its totient is φ = 135298405200.
The previous prime is 272157025121. The next prime is 272157025159. The reversal of 272157025132 is 231520751272.
It is a junction number, because it is equal to n+sod(n) for n = 272157025091 and 272157025100.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 5651757 + ... + 5699707.
It is an arithmetic number, because the mean of its divisors is an integer number (19958581440).
Almost surely, 2272157025132 is an apocalyptic number.
It is an amenable number.
272157025132 is a deficient number, since it is larger than the sum of its proper divisors (206848929428).
272157025132 is a wasteful number, since it uses less digits than its factorization.
272157025132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56061 (or 56059 counting only the distinct ones).
The product of its (nonzero) digits is 58800, while the sum is 37.
The spelling of 272157025132 in words is "two hundred seventy-two billion, one hundred fifty-seven million, twenty-five thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •