Base | Representation |
---|---|
bin | 1000100110100… |
… | …0111001101101 |
3 | 2111220010012000 |
4 | 2021220321231 |
5 | 33214100021 |
6 | 3325202513 |
7 | 615454116 |
oct | 211507155 |
9 | 74803160 |
10 | 36081261 |
11 | 19404427 |
12 | 10100439 |
13 | 7623c78 |
14 | 4b1320d |
15 | 327ab26 |
hex | 2268e6d |
36081261 has 8 divisors (see below), whose sum is σ = 53453760. Its totient is φ = 24054156.
The previous prime is 36081251. The next prime is 36081263. The reversal of 36081261 is 16218063.
36081261 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 36081261 - 25 = 36081229 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 1336343 = 36081261 / (3 + 6 + 0 + 8 + 1 + 2 + 6 + 1).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (36081263) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 668145 + ... + 668198.
It is an arithmetic number, because the mean of its divisors is an integer number (6681720).
Almost surely, 236081261 is an apocalyptic number.
It is an amenable number.
36081261 is a deficient number, since it is larger than the sum of its proper divisors (17372499).
36081261 is a wasteful number, since it uses less digits than its factorization.
36081261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1336352 (or 1336346 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The square root of 36081261 is about 6006.7679329237. The cubic root of 36081261 is about 330.4409807007.
The spelling of 36081261 in words is "thirty-six million, eighty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •