Base | Representation |
---|---|
bin | 100101100101111… |
… | …1010111011001000 |
3 | 10020220120120122011 |
4 | 1023023322323020 |
5 | 10040410304021 |
6 | 325100305304 |
7 | 43154601031 |
oct | 11313727310 |
9 | 3226516564 |
10 | 1261416136 |
11 | 598044682 |
12 | 2b2542234 |
13 | 171448ba6 |
14 | bd759a88 |
15 | 75b1cde1 |
hex | 4b2faec8 |
1261416136 has 16 divisors (see below), whose sum is σ = 2429078940. Its totient is φ = 613661760.
The previous prime is 1261416131. The next prime is 1261416139. The reversal of 1261416136 is 6316141621.
It can be written as a sum of positive squares in 2 ways, for example, as 1252452100 + 8964036 = 35390^2 + 2994^2 .
It is a super-2 number, since 2×12614161362 = 3182341336322340992, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1261416098 and 1261416107.
It is not an unprimeable number, because it can be changed into a prime (1261416131) 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 3 ways as a sum of consecutive naturals, for example, 2130475 + ... + 2131066.
Almost surely, 21261416136 is an apocalyptic number.
It is an amenable number.
1261416136 is a deficient number, since it is larger than the sum of its proper divisors (1167662804).
1261416136 is a wasteful number, since it uses less digits than its factorization.
1261416136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4261584 (or 4261580 counting only the distinct ones).
The product of its digits is 5184, while the sum is 31.
The square root of 1261416136 is about 35516.4206529881. The cubic root of 1261416136 is about 1080.4867878733.
Adding to 1261416136 its reverse (6316141621), we get a palindrome (7577557757).
The spelling of 1261416136 in words is "one billion, two hundred sixty-one million, four hundred sixteen thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •