Base | Representation |
---|---|
bin | 100010000000001110… |
… | …101100101011100000 |
3 | 10111020112000210012112 |
4 | 202000032230223200 |
5 | 1044233313400130 |
6 | 24434543014452 |
7 | 2431531005626 |
oct | 420016545340 |
9 | 114215023175 |
10 | 36511075040 |
11 | 14536606090 |
12 | 70ab59a428 |
13 | 359b2c2c1b |
14 | 1aa5093516 |
15 | e3a566495 |
hex | 8803acae0 |
36511075040 has 48 divisors (see below), whose sum is σ = 94099002480. Its totient is φ = 13276753920.
The previous prime is 36511075033. The next prime is 36511075043. The reversal of 36511075040 is 4057011563.
It is a super-2 number, since 2×365110750402 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a junction number, because it is equal to n+sod(n) for n = 36511074988 and 36511075006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (36511075043) 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, 10370705 + ... + 10374224.
It is an arithmetic number, because the mean of its divisors is an integer number (1960395885).
Almost surely, 236511075040 is an apocalyptic number.
It is an amenable number.
36511075040 is an abundant number, since it is smaller than the sum of its proper divisors (57587927440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
36511075040 is a wasteful number, since it uses less digits than its factorization.
36511075040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20744955 (or 20744947 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 32.
The spelling of 36511075040 in words is "thirty-six billion, five hundred eleven million, seventy-five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.170 sec. • engine limits •