Base | Representation |
---|---|
bin | 10010010010000111111001… |
… | …01011100000001100111000 |
3 | 12021100120110212010220001122 |
4 | 21021003330223200030320 |
5 | 20232210103041344310 |
6 | 221301552211404412 |
7 | 11316503452060430 |
oct | 1111037453401470 |
9 | 167316425126048 |
10 | 40205133153080 |
11 | 118a09a0579145 |
12 | 46140358b3708 |
13 | 19584351c620c |
14 | 9cdd201dd2c0 |
15 | 49ac63b4a555 |
hex | 2490fcae0338 |
40205133153080 has 64 divisors (see below), whose sum is σ = 103401757621440. Its totient is φ = 13782333146112.
The previous prime is 40205133153079. The next prime is 40205133153127. The reversal of 40205133153080 is 8035133150204.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a self number, because there is not a number n which added to its sum of digits gives 40205133153080.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10202117 + ... + 13582836.
It is an arithmetic number, because the mean of its divisors is an integer number (1615652462835).
Almost surely, 240205133153080 is an apocalyptic number.
40205133153080 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
40205133153080 is an abundant number, since it is smaller than the sum of its proper divisors (63196624468360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40205133153080 is a wasteful number, since it uses less digits than its factorization.
40205133153080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23791008 (or 23791004 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 35.
The spelling of 40205133153080 in words is "forty trillion, two hundred five billion, one hundred thirty-three million, one hundred fifty-three thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •