Base | Representation |
---|---|
bin | 100110011101000111… |
… | …010001100001101100 |
3 | 10221120121121121101120 |
4 | 212131013101201230 |
5 | 1134030400312442 |
6 | 30545121340540 |
7 | 2661135416100 |
oct | 463507214154 |
9 | 127517547346 |
10 | 41290635372 |
11 | 1656953a548 |
12 | 8004197750 |
13 | 3b8058bc2c |
14 | 1dd9b71900 |
15 | 1119e774ec |
hex | 99d1d186c |
41290635372 has 72 divisors (see below), whose sum is σ = 113184393840. Its totient is φ = 11680502400.
The previous prime is 41290635371. The next prime is 41290635481. The reversal of 41290635372 is 27353609214.
It is a super-3 number, since 3×412906353723 (a number of 33 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is not an unprimeable number, because it can be changed into a prime (41290635371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 288247 + ... + 407022.
It is an arithmetic number, because the mean of its divisors is an integer number (1572005470).
Almost surely, 241290635372 is an apocalyptic number.
41290635372 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
41290635372 is an abundant number, since it is smaller than the sum of its proper divisors (71893758468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41290635372 is a wasteful number, since it uses less digits than its factorization.
41290635372 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 695391 (or 695382 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 42.
The spelling of 41290635372 in words is "forty-one billion, two hundred ninety million, six hundred thirty-five thousand, three hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •