Base | Representation |
---|---|
bin | 1111001100011110110… |
… | …1000010001001101001 |
3 | 220221210220211021020112 |
4 | 3303013231002021221 |
5 | 13234111404242113 |
6 | 315531331304105 |
7 | 24601011500234 |
oct | 3630755021151 |
9 | 827726737215 |
10 | 261048509033 |
11 | a078a094654 |
12 | 4271474b035 |
13 | 1b80306c0c0 |
14 | c8c5d0c41b |
15 | 6bccc8b5a8 |
hex | 3cc7b42269 |
261048509033 has 16 divisors (see below), whose sum is σ = 305711214480. Its totient is φ = 220663719936.
The previous prime is 261048509027. The next prime is 261048509081. The reversal of 261048509033 is 330905840162.
261048509033 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 1087849 + 261047421184 = 1043^2 + 510928^2 .
It is a cyclic number.
It is not a de Polignac number, because 261048509033 - 26 = 261048508969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (261048509233) 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 15 ways as a sum of consecutive naturals, for example, 15954188 + ... + 15970541.
It is an arithmetic number, because the mean of its divisors is an integer number (19106950905).
Almost surely, 2261048509033 is an apocalyptic number.
It is an amenable number.
261048509033 is a deficient number, since it is larger than the sum of its proper divisors (44662705447).
261048509033 is a wasteful number, since it uses less digits than its factorization.
261048509033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31924796.
The product of its (nonzero) digits is 155520, while the sum is 41.
The spelling of 261048509033 in words is "two hundred sixty-one billion, forty-eight million, five hundred nine thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •