Base | Representation |
---|---|
bin | 100101110000001001… |
… | …001001010001000110 |
3 | 10212122000220211120000 |
4 | 211300021021101012 |
5 | 1131004223313420 |
6 | 30342210222130 |
7 | 2633344412400 |
oct | 456011112106 |
9 | 125560824500 |
10 | 40536151110 |
11 | 16211667334 |
12 | 7a33584946 |
13 | 3a90184340 |
14 | 1d67893b70 |
15 | 10c3ae1690 |
hex | 970249446 |
40536151110 has 480 divisors, whose sum is σ = 137527945632. Its totient is φ = 8491392000.
The previous prime is 40536151099. The next prime is 40536151121. The reversal of 40536151110 is 1115163504.
40536151110 is a `hidden beast` number, since 4 + 0 + 536 + 15 + 1 + 110 = 666.
It is an interprime number because it is at equal distance from previous prime (40536151099) and next prime (40536151121).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
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 239 ways as a sum of consecutive naturals, for example, 129508314 + ... + 129508626.
Almost surely, 240536151110 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40536151110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (68763972816).
40536151110 is an abundant number, since it is smaller than the sum of its proper divisors (96991794522).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40536151110 is a wasteful number, since it uses less digits than its factorization.
40536151110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 610 (or 594 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 27.
The spelling of 40536151110 in words is "forty billion, five hundred thirty-six million, one hundred fifty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •