Base | Representation |
---|---|
bin | 101000000011111011111… |
… | …001110010100100100000 |
3 | 100202011222200011110220021 |
4 | 220003323321302210200 |
5 | 330101123324100000 |
6 | 5504414013523224 |
7 | 402620015642644 |
oct | 50037371624440 |
9 | 10664880143807 |
10 | 2753005300000 |
11 | 9715a77a293a |
12 | 385673aa3514 |
13 | 16c7b828ca47 |
14 | 973636aac24 |
15 | 4b92a6b911a |
hex | 280fbe72920 |
2753005300000 has 72 divisors (see below), whose sum is σ = 6774540628212. Its totient is φ = 1101202080000.
The previous prime is 2753005299959. The next prime is 2753005300009. The reversal of 2753005300000 is 35003572.
It can be written as a sum of positive squares in 6 ways, for example, as 673837407376 + 2079167892624 = 820876^2 + 1441932^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (2753005300009) 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 11 ways as a sum of consecutive naturals, for example, 13665027 + ... + 13865026.
Almost surely, 22753005300000 is an apocalyptic number.
2753005300000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2753005300000 is an abundant number, since it is smaller than the sum of its proper divisors (4021535328212).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2753005300000 is an frugal number, since it uses more digits than its factorization.
2753005300000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27530088 (or 27530060 counting only the distinct ones).
The product of its (nonzero) digits is 3150, while the sum is 25.
The spelling of 2753005300000 in words is "two trillion, seven hundred fifty-three billion, five million, three hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •