Base | Representation |
---|---|
bin | 10010110100001110000001… |
… | …00100111100010000010111 |
3 | 12102111120100221102012101120 |
4 | 21122013000210330100113 |
5 | 20410403340110344311 |
6 | 224000100534055023 |
7 | 11500235660300562 |
oct | 1132070044742027 |
9 | 172446327365346 |
10 | 41376650871831 |
11 | 12202814803820 |
12 | 47830a47aa473 |
13 | 1a11a559a3062 |
14 | a308d7ab54d9 |
15 | 4bb47d0a6706 |
hex | 25a1c093c417 |
41376650871831 has 8 divisors (see below), whose sum is σ = 60184219449984. Its totient is φ = 25076758104120.
The previous prime is 41376650871811. The next prime is 41376650871859. The reversal of 41376650871831 is 13817805667314.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 41376650871831 - 217 = 41376650740759 is a prime.
It is a super-2 number, since 2×413766508718312 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41376650871811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 626918952571 + ... + 626918952636.
It is an arithmetic number, because the mean of its divisors is an integer number (7523027431248).
Almost surely, 241376650871831 is an apocalyptic number.
41376650871831 is a deficient number, since it is larger than the sum of its proper divisors (18807568578153).
41376650871831 is a wasteful number, since it uses less digits than its factorization.
41376650871831 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1253837905221.
The product of its (nonzero) digits is 20321280, while the sum is 60.
The spelling of 41376650871831 in words is "forty-one trillion, three hundred seventy-six billion, six hundred fifty million, eight hundred seventy-one thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •