Base | Representation |
---|---|
bin | 11111000101100001110… |
… | …110000010000111111100 |
3 | 21120020000021000012122010 |
4 | 133011201312002013330 |
5 | 240000010004104130 |
6 | 4313213015251220 |
7 | 310224011644323 |
oct | 37054166020774 |
9 | 7506007005563 |
10 | 2136240300540 |
11 | 753a79a5a095 |
12 | 2a6026679b10 |
13 | 1265a622c518 |
14 | 75574a3b0ba |
15 | 3a87dae40b0 |
hex | 1f161d821fc |
2136240300540 has 96 divisors (see below), whose sum is σ = 5989902299136. Its totient is φ = 568861885440.
The previous prime is 2136240300443. The next prime is 2136240300563. The reversal of 2136240300540 is 450030426312.
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 = 2136240300498 and 2136240300507.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 132587085 + ... + 132603195.
It is an arithmetic number, because the mean of its divisors is an integer number (62394815616).
Almost surely, 22136240300540 is an apocalyptic number.
2136240300540 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2136240300540 is an abundant number, since it is smaller than the sum of its proper divisors (3853661998596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2136240300540 is a wasteful number, since it uses less digits than its factorization.
2136240300540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19099 (or 19097 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 30.
Adding to 2136240300540 its reverse (450030426312), we get a palindrome (2586270726852).
The spelling of 2136240300540 in words is "two trillion, one hundred thirty-six billion, two hundred forty million, three hundred thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •