Base | Representation |
---|---|
bin | 100110011110011000… |
… | …111011110010001000 |
3 | 10221122002220011221002 |
4 | 212132120323302020 |
5 | 1134101340321440 |
6 | 30551204234132 |
7 | 2661515364326 |
oct | 463630736210 |
9 | 127562804832 |
10 | 41312042120 |
11 | 1657a630778 |
12 | 800b39b948 |
13 | 3b84b4574b |
14 | 1ddc944d16 |
15 | 111bca5115 |
hex | 99e63bc88 |
41312042120 has 64 divisors (see below), whose sum is σ = 96900848640. Its totient is φ = 15833376000.
The previous prime is 41312042117. The next prime is 41312042131. The reversal of 41312042120 is 2124021314.
41312042120 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 41312042092 and 41312042101.
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, 39692 + ... + 290171.
It is an arithmetic number, because the mean of its divisors is an integer number (1514075760).
Almost surely, 241312042120 is an apocalyptic number.
41312042120 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
41312042120 is an abundant number, since it is smaller than the sum of its proper divisors (55588806520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41312042120 is a wasteful number, since it uses less digits than its factorization.
41312042120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 330006 (or 330002 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 41312042120 its reverse (2124021314), we get a palindrome (43436063434).
The spelling of 41312042120 in words is "forty-one billion, three hundred twelve million, forty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •