Base | Representation |
---|---|
bin | 1000101011100… |
… | …1011010110001 |
3 | 2112111212120200 |
4 | 2022321122301 |
5 | 33310123212 |
6 | 3340225413 |
7 | 621326454 |
oct | 212713261 |
9 | 75455520 |
10 | 36411057 |
11 | 1960a191 |
12 | 1023b269 |
13 | 770b107 |
14 | 4b9b49b |
15 | 32e36dc |
hex | 22b96b1 |
36411057 has 24 divisors (see below), whose sum is σ = 53745120. Its totient is φ = 23749440.
The previous prime is 36411043. The next prime is 36411061. The reversal of 36411057 is 75011463.
36411057 is a `hidden beast` number, since 3 + 641 + 10 + 5 + 7 = 666.
36411057 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 36411057 - 27 = 36410929 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 36411057.
It is not an unprimeable number, because it can be changed into a prime (36411007) 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 23 ways as a sum of consecutive naturals, for example, 104758 + ... + 105104.
It is an arithmetic number, because the mean of its divisors is an integer number (2239380).
Almost surely, 236411057 is an apocalyptic number.
It is an amenable number.
36411057 is a deficient number, since it is larger than the sum of its proper divisors (17334063).
36411057 is a wasteful number, since it uses less digits than its factorization.
36411057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 573 (or 570 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 36411057 is about 6034.1575219744. The cubic root of 36411057 is about 331.4447127688. Note that the first 3 decimals are identical.
The spelling of 36411057 in words is "thirty-six million, four hundred eleven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •