Base | Representation |
---|---|
bin | 10001000101111000101111… |
… | …110011100110110100001000 |
3 | 100212011022022111220222002111 |
4 | 101011320233303212310020 |
5 | 34323101330314001242 |
6 | 423513121051112104 |
7 | 21555643243415611 |
oct | 2105705763466410 |
9 | 325138274828074 |
10 | 75171319672072 |
11 | 21a51a83273a28 |
12 | 8520856a42634 |
13 | 32c381825a0a0 |
14 | 147c450246c08 |
15 | 8a55a283b817 |
hex | 445e2fce6d08 |
75171319672072 has 32 divisors (see below), whose sum is σ = 151808533049880. Its totient is φ = 34689817198080.
The previous prime is 75171319672063. The next prime is 75171319672073. The reversal of 75171319672072 is 27027691317157.
It can be written as a sum of positive squares in 4 ways, for example, as 61828561776996 + 13342757895076 = 7863114^2 + 3652774^2 .
It is a junction number, because it is equal to n+sod(n) for n = 75171319671998 and 75171319672016.
It is not an unprimeable number, because it can be changed into a prime (75171319672073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47531103 + ... + 49087150.
Almost surely, 275171319672072 is an apocalyptic number.
It is an amenable number.
75171319672072 is an abundant number, since it is smaller than the sum of its proper divisors (76637213377808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
75171319672072 is a wasteful number, since it uses less digits than its factorization.
75171319672072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96625753 (or 96625749 counting only the distinct ones).
The product of its (nonzero) digits is 7779240, while the sum is 58.
The spelling of 75171319672072 in words is "seventy-five trillion, one hundred seventy-one billion, three hundred nineteen million, six hundred seventy-two thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •