Base | Representation |
---|---|
bin | 100110100101011001… |
… | …101001110000000000 |
3 | 10221221022020100022000 |
4 | 212211121221300000 |
5 | 1134321443432122 |
6 | 31011005344000 |
7 | 2664444251400 |
oct | 464531516000 |
9 | 127838210260 |
10 | 41429670912 |
11 | 1662aa72a53 |
12 | 8042868000 |
13 | 3ba331c296 |
14 | 2010404800 |
15 | 112728d0ac |
hex | 9a5669c00 |
41429670912 has 528 divisors, whose sum is σ = 145671397920. Its totient is φ = 11593580544.
The previous prime is 41429670911. The next prime is 41429670929. The reversal of 41429670912 is 21907692414.
It is a super-4 number, since 4×414296709124 (a number of 44 digits) contains 4444 as substring. Note that it is a super-d number also for d = 3.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41429670911) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 71801568 + ... + 71802144.
Almost surely, 241429670912 is an apocalyptic number.
41429670912 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41429670912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72835698960).
41429670912 is an abundant number, since it is smaller than the sum of its proper divisors (104241727008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41429670912 is a wasteful number, since it uses less digits than its factorization.
41429670912 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 673 (or 642 counting only the distinct ones).
The product of its (nonzero) digits is 217728, while the sum is 45.
The spelling of 41429670912 in words is "forty-one billion, four hundred twenty-nine million, six hundred seventy thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •