Base | Representation |
---|---|
bin | 100111110000100110001… |
… | …110110111110100110100 |
3 | 100200012101112210002220201 |
4 | 213300212032313310310 |
5 | 324231112100230030 |
6 | 5451101331010244 |
7 | 401253320122414 |
oct | 47604616676464 |
9 | 10605345702821 |
10 | 2732240633140 |
11 | 963811676337 |
12 | 381639a39984 |
13 | 16a859353815 |
14 | 96353a16644 |
15 | 4b1127552ca |
hex | 27c263b7d34 |
2732240633140 has 24 divisors (see below), whose sum is σ = 5764898254752. Its totient is φ = 1087716648480.
The previous prime is 2732240633117. The next prime is 2732240633201. The reversal of 2732240633140 is 413360422372.
It is a self number, because there is not a number n which added to its sum of digits gives 2732240633140.
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, 323720974 + ... + 323729413.
It is an arithmetic number, because the mean of its divisors is an integer number (240204093948).
Almost surely, 22732240633140 is an apocalyptic number.
2732240633140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2732240633140 is an abundant number, since it is smaller than the sum of its proper divisors (3032657621612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2732240633140 is a wasteful number, since it uses less digits than its factorization.
2732240633140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 647450607 (or 647450605 counting only the distinct ones).
The product of its (nonzero) digits is 145152, while the sum is 37.
The spelling of 2732240633140 in words is "two trillion, seven hundred thirty-two billion, two hundred forty million, six hundred thirty-three thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •