Base | Representation |
---|---|
bin | 101000011000101110010… |
… | …010000000010111001110 |
3 | 100211022121012021020220010 |
4 | 220120232102000113032 |
5 | 330432331242021410 |
6 | 5522544501534050 |
7 | 404340102126054 |
oct | 50305622002716 |
9 | 10738535236803 |
10 | 2775325345230 |
11 | 980010894209 |
12 | 389a62a14326 |
13 | 17193450a6b9 |
14 | 9847db5c1d4 |
15 | 4c2d4e65c20 |
hex | 2862e4805ce |
2775325345230 has 32 divisors (see below), whose sum is σ = 6660828985248. Its totient is φ = 740081408000.
The previous prime is 2775325345223. The next prime is 2775325345231. The reversal of 2775325345230 is 325435235772.
It is a super-3 number, since 3×27753253452303 (a number of 38 digits) contains 333 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2775325345230.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2775325345231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5625310 + ... + 6098750.
It is an arithmetic number, because the mean of its divisors is an integer number (208150905789).
Almost surely, 22775325345230 is an apocalyptic number.
2775325345230 is an abundant number, since it is smaller than the sum of its proper divisors (3885503640018).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2775325345230 is a wasteful number, since it uses less digits than its factorization.
2775325345230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 668852.
The product of its (nonzero) digits is 5292000, while the sum is 48.
The spelling of 2775325345230 in words is "two trillion, seven hundred seventy-five billion, three hundred twenty-five million, three hundred forty-five thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •