Base | Representation |
---|---|
bin | 100010000011110001… |
… | …0111101101011000101 |
3 | 20222210022210022111202 |
4 | 1010013202331223011 |
5 | 2144243102100203 |
6 | 53333414312245 |
7 | 5166334444661 |
oct | 1040742755305 |
9 | 228708708452 |
10 | 73141050053 |
11 | 29023241505 |
12 | 12212958685 |
13 | 6b88116156 |
14 | 377bc578a1 |
15 | 1d81267388 |
hex | 11078bdac5 |
73141050053 has 8 divisors (see below), whose sum is σ = 77458246488. Its totient is φ = 68825496064.
The previous prime is 73141050049. The next prime is 73141050067. The reversal of 73141050053 is 35005014137.
It can be written as a sum of positive squares in 4 ways, for example, as 3073371844 + 70067678209 = 55438^2 + 264703^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 73141050053 - 22 = 73141050049 is a prime.
It is a super-2 number, since 2×731410500532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 73141049998 and 73141050025.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (73141020053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 318326 + ... + 497607.
It is an arithmetic number, because the mean of its divisors is an integer number (9682280811).
Almost surely, 273141050053 is an apocalyptic number.
It is an amenable number.
73141050053 is a deficient number, since it is larger than the sum of its proper divisors (4317196435).
73141050053 is a wasteful number, since it uses less digits than its factorization.
73141050053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 821223.
The product of its (nonzero) digits is 6300, while the sum is 29.
The spelling of 73141050053 in words is "seventy-three billion, one hundred forty-one million, fifty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •