Base | Representation |
---|---|
bin | 101101100101000101… |
… | …110101000000111001 |
3 | 11200022202111110211222 |
4 | 231211011311000321 |
5 | 1300212302320222 |
6 | 34252200201425 |
7 | 3351536543111 |
oct | 554505650071 |
9 | 150282443758 |
10 | 48940666937 |
11 | 19834804488 |
12 | 959a169275 |
13 | 47cc45a326 |
14 | 2523b7a041 |
15 | 1416893542 |
hex | b65175039 |
48940666937 has 4 divisors (see below), whose sum is σ = 51819529716. Its totient is φ = 46061804160.
The previous prime is 48940666891. The next prime is 48940666939. The reversal of 48940666937 is 73966604984.
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 43189568041 + 5751098896 = 207821^2 + 75836^2 .
It is a cyclic number.
It is not a de Polignac number, because 48940666937 - 220 = 48939618361 is a prime.
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 48940666937.
It is not an unprimeable number, because it can be changed into a prime (48940666939) 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 3 ways as a sum of consecutive naturals, for example, 1439431364 + ... + 1439431397.
It is an arithmetic number, because the mean of its divisors is an integer number (12954882429).
Almost surely, 248940666937 is an apocalyptic number.
It is an amenable number.
48940666937 is a deficient number, since it is larger than the sum of its proper divisors (2878862779).
48940666937 is a wasteful number, since it uses less digits than its factorization.
48940666937 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2878862778.
The product of its (nonzero) digits is 47029248, while the sum is 62.
The spelling of 48940666937 in words is "forty-eight billion, nine hundred forty million, six hundred sixty-six thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •