Base | Representation |
---|---|
bin | 100001101010100010… |
… | …010010010101001000 |
3 | 10110022011011111201210 |
4 | 201222202102111020 |
5 | 1043012130024430 |
6 | 24334502013120 |
7 | 2416521242652 |
oct | 415242222510 |
9 | 113264144653 |
10 | 36147111240 |
11 | 1436a113759 |
12 | 70097171a0 |
13 | 3540a8ac26 |
14 | 1a6c9cd6d2 |
15 | e186202b0 |
hex | 86a892548 |
36147111240 has 64 divisors (see below), whose sum is σ = 109221537600. Its totient is φ = 9569878272.
The previous prime is 36147111229. The next prime is 36147111263. The reversal of 36147111240 is 4211174163.
It is a super-2 number, since 2×361471112402 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 36147111198 and 36147111207.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 1066867 + ... + 1100226.
It is an arithmetic number, because the mean of its divisors is an integer number (1706586525).
Almost surely, 236147111240 is an apocalyptic number.
36147111240 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
36147111240 is an abundant number, since it is smaller than the sum of its proper divisors (73074426360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
36147111240 is a wasteful number, since it uses less digits than its factorization.
36147111240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2167246 (or 2167242 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 30.
The spelling of 36147111240 in words is "thirty-six billion, one hundred forty-seven million, one hundred eleven thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •