Base | Representation |
---|---|
bin | 100101101011111110… |
… | …000101111101010001 |
3 | 10212110011012011101000 |
4 | 211223332011331101 |
5 | 1130333313120410 |
6 | 30331225532213 |
7 | 2631534362301 |
oct | 455376057521 |
9 | 125404164330 |
10 | 40466145105 |
11 | 161860a1831 |
12 | 7a14044069 |
13 | 3a7b812b79 |
14 | 1d5c46d601 |
15 | 10bc8b3dc0 |
hex | 96bf85f51 |
40466145105 has 32 divisors (see below), whose sum is σ = 73013558400. Its totient is φ = 21259820736.
The previous prime is 40466145091. The next prime is 40466145107. The reversal of 40466145105 is 50154166404.
40466145105 is a `hidden beast` number, since 40 + 46 + 61 + 4 + 510 + 5 = 666.
It is not a de Polignac number, because 40466145105 - 216 = 40466079569 is a prime.
It is a super-2 number, since 2×404661451052 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 40466145105.
It is not an unprimeable number, because it can be changed into a prime (40466145107) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2227890 + ... + 2245979.
It is an arithmetic number, because the mean of its divisors is an integer number (2281673700).
Almost surely, 240466145105 is an apocalyptic number.
40466145105 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
40466145105 is a deficient number, since it is larger than the sum of its proper divisors (32547413295).
40466145105 is a wasteful number, since it uses less digits than its factorization.
40466145105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4473950 (or 4473944 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 36.
The spelling of 40466145105 in words is "forty billion, four hundred sixty-six million, one hundred forty-five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •