Base | Representation |
---|---|
bin | 1000000000110101011… |
… | …10101001000110111001 |
3 | 222022122222002022101200 |
4 | 10000122232221012321 |
5 | 14002332020412221 |
6 | 330252211004413 |
7 | 25614562201155 |
oct | 4003256510671 |
9 | 868588068350 |
10 | 275326341561 |
11 | a68465a6547 |
12 | 4543a299709 |
13 | 1cc6a0b6c0b |
14 | d47c268065 |
15 | 72664a0426 |
hex | 401aba91b9 |
275326341561 has 12 divisors (see below), whose sum is σ = 401213018388. Its totient is φ = 181926549504.
The previous prime is 275326341509. The next prime is 275326341581. The reversal of 275326341561 is 165143623572.
275326341561 is a `hidden beast` number, since 2 + 7 + 5 + 3 + 2 + 634 + 1 + 5 + 6 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 6525569961 + 268800771600 = 80781^2 + 518460^2 .
It is not a de Polignac number, because 275326341561 - 229 = 274789470649 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (275326341581) 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 11 ways as a sum of consecutive naturals, for example, 135361000 + ... + 135363033.
It is an arithmetic number, because the mean of its divisors is an integer number (33434418199).
Almost surely, 2275326341561 is an apocalyptic number.
It is an amenable number.
275326341561 is a deficient number, since it is larger than the sum of its proper divisors (125886676827).
275326341561 is a wasteful number, since it uses less digits than its factorization.
275326341561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270724152 (or 270724149 counting only the distinct ones).
The product of its digits is 907200, while the sum is 45.
The spelling of 275326341561 in words is "two hundred seventy-five billion, three hundred twenty-six million, three hundred forty-one thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •