Base | Representation |
---|---|
bin | 111000001000000101… |
… | …1111011010011110101 |
3 | 102112002222200020022200 |
4 | 1300100023323103311 |
5 | 3433321321140021 |
6 | 131212050015113 |
7 | 11464601406024 |
oct | 1602013732365 |
9 | 375088606280 |
10 | 120530646261 |
11 | 47131453553 |
12 | 1b439577499 |
13 | b49b10c63c |
14 | 5b959d88bb |
15 | 3206874126 |
hex | 1c102fb4f5 |
120530646261 has 12 divisors (see below), whose sum is σ = 177384725388. Its totient is φ = 78837655104.
The previous prime is 120530646233. The next prime is 120530646277. The reversal of 120530646261 is 162646035021.
120530646261 is a `hidden beast` number, since 1 + 2 + 0 + 5 + 3 + 0 + 646 + 2 + 6 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 110144998161 + 10385648100 = 331881^2 + 101910^2 .
It is not a de Polignac number, because 120530646261 - 29 = 120530645749 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120530646211) 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, 126341920 + ... + 126342873.
It is an arithmetic number, because the mean of its divisors is an integer number (14782060449).
Almost surely, 2120530646261 is an apocalyptic number.
It is an amenable number.
120530646261 is a deficient number, since it is larger than the sum of its proper divisors (56854079127).
120530646261 is a wasteful number, since it uses less digits than its factorization.
120530646261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 252684852 (or 252684849 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The spelling of 120530646261 in words is "one hundred twenty billion, five hundred thirty million, six hundred forty-six thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •