Base | Representation |
---|---|
bin | 10010110000011011100111… |
… | …11100101011100111101000 |
3 | 12102001010110122010110202200 |
4 | 21120031303330223213220 |
5 | 20401240331123340012 |
6 | 223420215445100200 |
7 | 11454651060142356 |
oct | 1130156374534750 |
9 | 172033418113680 |
10 | 41246516230632 |
11 | 12162605132779 |
12 | 4761a269b7660 |
13 | 1a026b6c4939b |
14 | a284b079c7d6 |
15 | 4b7db34e93dc |
hex | 258373f2b9e8 |
41246516230632 has 48 divisors (see below), whose sum is σ = 114728485468740. Its totient is φ = 13377248506368.
The previous prime is 41246516230571. The next prime is 41246516230637. The reversal of 41246516230632 is 23603261564214.
41246516230632 is a `hidden beast` number, since 4 + 1 + 2 + 4 + 6 + 5 + 1 + 6 + 2 + 3 + 0 + 632 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 41234814616356 + 11701614276 = 6421434^2 + 108174^2 .
It is not an unprimeable number, because it can be changed into a prime (41246516230637) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7741460593 + ... + 7741465920.
Almost surely, 241246516230632 is an apocalyptic number.
It is an amenable number.
41246516230632 is an abundant number, since it is smaller than the sum of its proper divisors (73481969238108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41246516230632 is a wasteful number, since it uses less digits than its factorization.
41246516230632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15482926562 (or 15482926555 counting only the distinct ones).
The product of its (nonzero) digits is 1244160, while the sum is 45.
Adding to 41246516230632 its reverse (23603261564214), we get a palindrome (64849777794846).
The spelling of 41246516230632 in words is "forty-one trillion, two hundred forty-six billion, five hundred sixteen million, two hundred thirty thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •