Base | Representation |
---|---|
bin | 11111001101101101… |
… | …011100101000111100 |
3 | 10012111210021221001001 |
4 | 133031231130220330 |
5 | 1022120044423030 |
6 | 23221432300044 |
7 | 2264362263640 |
oct | 371555345074 |
9 | 105453257031 |
10 | 33516014140 |
11 | 13239a09544 |
12 | 65b4541624 |
13 | 321194a83b |
14 | 189d3b4c20 |
15 | d1264acca |
hex | 7cdb5ca3c |
33516014140 has 48 divisors (see below), whose sum is σ = 82612458432. Its totient is φ = 11180630016.
The previous prime is 33516014137. The next prime is 33516014141. The reversal of 33516014140 is 4141061533.
It is a super-2 number, since 2×335160141402 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 33516014099 and 33516014108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (33516014141) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3229957 + ... + 3240316.
It is an arithmetic number, because the mean of its divisors is an integer number (1721092884).
Almost surely, 233516014140 is an apocalyptic number.
It is an amenable number.
33516014140 is an abundant number, since it is smaller than the sum of its proper divisors (49096444292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
33516014140 is a wasteful number, since it uses less digits than its factorization.
33516014140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6470326 (or 6470324 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 33516014140 its reverse (4141061533), we get a palindrome (37657075673).
The spelling of 33516014140 in words is "thirty-three billion, five hundred sixteen million, fourteen thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •