Base | Representation |
---|---|
bin | 101000000011001111110… |
… | …000110100110001110100 |
3 | 100202010002001200202100121 |
4 | 220003033300310301310 |
5 | 330043114234032434 |
6 | 5504212321221324 |
7 | 402562454252410 |
oct | 50031760646164 |
9 | 10663061622317 |
10 | 2752264752244 |
11 | 9712577793a7 |
12 | 3854a7a91844 |
13 | 16c6caa246c7 |
14 | 972d31b9d40 |
15 | 4b8d56877b4 |
hex | 280cfc34c74 |
2752264752244 has 12 divisors (see below), whose sum is σ = 5504529504544. Its totient is φ = 1179542036664.
The previous prime is 2752264752241. The next prime is 2752264752301. The reversal of 2752264752244 is 4422574622572.
2752264752244 is an admirable number.
It is a super-2 number, since 2×27522647522442 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2752264752191 and 2752264752200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2752264752241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 49147584834 + ... + 49147584889.
Almost surely, 22752264752244 is an apocalyptic number.
It is an amenable number.
2752264752244 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2752264752244 is a wasteful number, since it uses less digits than its factorization.
2752264752244 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98295169734 (or 98295169732 counting only the distinct ones).
The product of its digits is 15052800, while the sum is 52.
The spelling of 2752264752244 in words is "two trillion, seven hundred fifty-two billion, two hundred sixty-four million, seven hundred fifty-two thousand, two hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •