Base | Representation |
---|---|
bin | 111101111000001010100011… |
… | …001001000101101010111000 |
3 | 1022200120101002012201202020011 |
4 | 331320022203021011222320 |
5 | 241132222122422043010 |
6 | 2402443333221311304 |
7 | 111215333111251531 |
oct | 7570124311055270 |
9 | 1280511065652204 |
10 | 272140454877880 |
11 | 79792134100926 |
12 | 26632787865534 |
13 | b8b0972405c34 |
14 | 4b2b94db35688 |
15 | 216dee7687a8a |
hex | f782a3245ab8 |
272140454877880 has 32 divisors (see below), whose sum is σ = 648334613093040. Its totient is φ = 102452877130240.
The previous prime is 272140454877719. The next prime is 272140454877911. The reversal of 272140454877880 is 88778454041272.
It is a super-2 number, since 2×2721404548778802 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
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, 200103274966 + ... + 200103276325.
Almost surely, 2272140454877880 is an apocalyptic number.
272140454877880 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
272140454877880 is an abundant number, since it is smaller than the sum of its proper divisors (376194158215160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
272140454877880 is a wasteful number, since it uses less digits than its factorization.
272140454877880 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400206551319 (or 400206551315 counting only the distinct ones).
The product of its (nonzero) digits is 224788480, while the sum is 67.
The spelling of 272140454877880 in words is "two hundred seventy-two trillion, one hundred forty billion, four hundred fifty-four million, eight hundred seventy-seven thousand, eight hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •