Base | Representation |
---|---|
bin | 100111000101111101… |
… | …011111110101000001 |
3 | 11000100101010121101001 |
4 | 213011331133311001 |
5 | 1141431320011434 |
6 | 31141122012001 |
7 | 3014126406031 |
oct | 470575376501 |
9 | 130311117331 |
10 | 41975938369 |
11 | 16890360862 |
12 | 81757a7001 |
13 | 3c5c553871 |
14 | 2062ba18c1 |
15 | 115a1e5114 |
hex | 9c5f5fd41 |
41975938369 has 4 divisors (see below), whose sum is σ = 41977360260. Its totient is φ = 41974516480.
The previous prime is 41975938363. The next prime is 41975938409. The reversal of 41975938369 is 96383957914.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 38303578369 + 3672360000 = 195713^2 + 60600^2 .
It is a cyclic number.
It is not a de Polignac number, because 41975938369 - 217 = 41975807297 is a prime.
It is a super-2 number, since 2×419759383692 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 41975938369.
It is not an unprimeable number, because it can be changed into a prime (41975938363) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 665704 + ... + 726025.
It is an arithmetic number, because the mean of its divisors is an integer number (10494340065).
Almost surely, 241975938369 is an apocalyptic number.
It is an amenable number.
41975938369 is a deficient number, since it is larger than the sum of its proper divisors (1421891).
41975938369 is a wasteful number, since it uses less digits than its factorization.
41975938369 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1421890.
The product of its digits is 44089920, while the sum is 64.
The spelling of 41975938369 in words is "forty-one billion, nine hundred seventy-five million, nine hundred thirty-eight thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •