Base | Representation |
---|---|
bin | 101000000001001001000… |
… | …100110000001110100001 |
3 | 100201220020120200002210212 |
4 | 220001021010300032201 |
5 | 330024002243133241 |
6 | 5503200200103505 |
7 | 402452455156112 |
oct | 50011104601641 |
9 | 10656216602725 |
10 | 2750005052321 |
11 | 9702a81833aa |
12 | 384b77164b95 |
13 | 16c42a81c867 |
14 | 9715b03c209 |
15 | 4b8020c6beb |
hex | 280491303a1 |
2750005052321 has 4 divisors (see below), whose sum is σ = 2760228119700. Its totient is φ = 2739781984944.
The previous prime is 2750005052243. The next prime is 2750005052329. The reversal of 2750005052321 is 1232505000572.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 162861480721 + 2587143571600 = 403561^2 + 1608460^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2750005052321 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2750005052329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5111533286 + ... + 5111533823.
It is an arithmetic number, because the mean of its divisors is an integer number (690057029925).
Almost surely, 22750005052321 is an apocalyptic number.
It is an amenable number.
2750005052321 is a deficient number, since it is larger than the sum of its proper divisors (10223067379).
2750005052321 is a wasteful number, since it uses less digits than its factorization.
2750005052321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10223067378.
The product of its (nonzero) digits is 21000, while the sum is 32.
The spelling of 2750005052321 in words is "two trillion, seven hundred fifty billion, five million, fifty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •