Base | Representation |
---|---|
bin | 10001000111110101001100… |
… | …001001010110001000001100 |
3 | 100212122002012200111011122112 |
4 | 101013311030021112020030 |
5 | 34332244003403302431 |
6 | 424054340023403152 |
7 | 21601413410111660 |
oct | 2107651411261014 |
9 | 325562180434575 |
10 | 75304939119116 |
11 | 21aa3710a34203 |
12 | 85427278b34b8 |
13 | 33032c0c60555 |
14 | 1484ac82c48a0 |
15 | 8a8cc3303c2b |
hex | 447d4c25620c |
75304939119116 has 48 divisors (see below), whose sum is σ = 153837313862400. Its totient is φ = 31586771460288.
The previous prime is 75304939119079. The next prime is 75304939119127. The reversal of 75304939119116 is 61191193940357.
It is a happy number.
It is a Smith number, since the sum of its digits (59) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (59).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 100030511 + ... + 100780518.
It is an arithmetic number, because the mean of its divisors is an integer number (3204944038800).
Almost surely, 275304939119116 is an apocalyptic number.
It is an amenable number.
75304939119116 is an abundant number, since it is smaller than the sum of its proper divisors (78532374743284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
75304939119116 is a wasteful number, since it uses less digits than its factorization.
75304939119116 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200811326 (or 200811324 counting only the distinct ones).
The product of its (nonzero) digits is 5511240, while the sum is 59.
The spelling of 75304939119116 in words is "seventy-five trillion, three hundred four billion, nine hundred thirty-nine million, one hundred nineteen thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •