Base | Representation |
---|---|
bin | 100111110000100110001… |
… | …110111111101000011001 |
3 | 100200012101112211201202220 |
4 | 213300212032333220121 |
5 | 324231112102240423 |
6 | 5451101331414253 |
7 | 401253320314551 |
oct | 47604616775031 |
9 | 10605345751686 |
10 | 2732240665113 |
11 | 963811698363 |
12 | 381639a54389 |
13 | 16a85936523b |
14 | 96353a24161 |
15 | 4b11275e9e3 |
hex | 27c263bfa19 |
2732240665113 has 8 divisors (see below), whose sum is σ = 3643023030528. Its totient is φ = 1821476038224.
The previous prime is 2732240665081. The next prime is 2732240665151. The reversal of 2732240665113 is 3115660422372.
2732240665113 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2732240665113 - 25 = 2732240665081 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2732240665013) 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 7 ways as a sum of consecutive naturals, for example, 4070970 + ... + 4694387.
It is an arithmetic number, because the mean of its divisors is an integer number (455377878816).
Almost surely, 22732240665113 is an apocalyptic number.
It is an amenable number.
2732240665113 is a deficient number, since it is larger than the sum of its proper divisors (910782365415).
2732240665113 is a wasteful number, since it uses less digits than its factorization.
2732240665113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8869263.
The product of its (nonzero) digits is 362880, while the sum is 42.
The spelling of 2732240665113 in words is "two trillion, seven hundred thirty-two billion, two hundred forty million, six hundred sixty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •