Base | Representation |
---|---|
bin | 100101100101110… |
… | …0110011001011101 |
3 | 10020220102022022021 |
4 | 1023023212121131 |
5 | 10040400111221 |
6 | 325054420141 |
7 | 43154100643 |
oct | 11313463135 |
9 | 3226368267 |
10 | 1261332061 |
11 | 597a974a0 |
12 | 2b2501651 |
13 | 171419842 |
14 | bd737193 |
15 | 75b03041 |
hex | 4b2e665d |
1261332061 has 16 divisors (see below), whose sum is σ = 1469376000. Its totient is φ = 1071403200.
The previous prime is 1261332053. The next prime is 1261332071. The reversal of 1261332061 is 1602331621.
It is a cyclic number.
It is not a de Polignac number, because 1261332061 - 23 = 1261332053 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1261332071) 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, 53886 + ... + 73663.
It is an arithmetic number, because the mean of its divisors is an integer number (91836000).
Almost surely, 21261332061 is an apocalyptic number.
1261332061 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1261332061 is a deficient number, since it is larger than the sum of its proper divisors (208043939).
1261332061 is a wasteful number, since it uses less digits than its factorization.
1261332061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127620.
The product of its (nonzero) digits is 1296, while the sum is 25.
The square root of 1261332061 is about 35515.2370258175. The cubic root of 1261332061 is about 1080.4627820642.
Adding to 1261332061 its reverse (1602331621), we get a palindrome (2863663682).
The spelling of 1261332061 in words is "one billion, two hundred sixty-one million, three hundred thirty-two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •