Base | Representation |
---|---|
bin | 1000000001010000001… |
… | …00111000010111101101 |
3 | 222100020120110022101201 |
4 | 10000220010320113231 |
5 | 14003311332300203 |
6 | 330330330405501 |
7 | 25623251456404 |
oct | 4005004702755 |
9 | 870216408351 |
10 | 275550275053 |
11 | a6950a46049 |
12 | 454a1290891 |
13 | 1cca4600b41 |
14 | d49dcba63b |
15 | 727ae85e1d |
hex | 40281385ed |
275550275053 has 4 divisors (see below), whose sum is σ = 291759114780. Its totient is φ = 259341435328.
The previous prime is 275550274999. The next prime is 275550275059. The reversal of 275550275053 is 350572055572.
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 132119164324 + 143431110729 = 363482^2 + 378723^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-275550275053 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 275550274994 and 275550275012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (275550275059) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8104419838 + ... + 8104419871.
It is an arithmetic number, because the mean of its divisors is an integer number (72939778695).
Almost surely, 2275550275053 is an apocalyptic number.
It is an amenable number.
275550275053 is a deficient number, since it is larger than the sum of its proper divisors (16208839727).
275550275053 is a wasteful number, since it uses less digits than its factorization.
275550275053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16208839726.
The product of its (nonzero) digits is 1837500, while the sum is 46.
The spelling of 275550275053 in words is "two hundred seventy-five billion, five hundred fifty million, two hundred seventy-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •