Base | Representation |
---|---|
bin | 100010000010110011… |
… | …1010101101000111001 |
3 | 20222201001210211111212 |
4 | 1010011213111220321 |
5 | 2144211303023421 |
6 | 53330255532505 |
7 | 5165462130626 |
oct | 1040547255071 |
9 | 228631724455 |
10 | 73108642361 |
11 | 29006a17097 |
12 | 12203b2a135 |
13 | 6b814aa2c1 |
14 | 377781d34d |
15 | 1d7d4b4e5b |
hex | 11059d5a39 |
73108642361 has 4 divisors (see below), whose sum is σ = 75084551652. Its totient is φ = 71132733072.
The previous prime is 73108642357. The next prime is 73108642367. The reversal of 73108642361 is 16324680137.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 16324680137 = 22901 ⋅712837.
It can be written as a sum of positive squares in 2 ways, for example, as 56539803961 + 16568838400 = 237781^2 + 128720^2 .
It is a cyclic number.
It is not a de Polignac number, because 73108642361 - 22 = 73108642357 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (73108642367) 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, 987954590 + ... + 987954663.
It is an arithmetic number, because the mean of its divisors is an integer number (18771137913).
Almost surely, 273108642361 is an apocalyptic number.
It is an amenable number.
73108642361 is a deficient number, since it is larger than the sum of its proper divisors (1975909291).
73108642361 is a wasteful number, since it uses less digits than its factorization.
73108642361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1975909290.
The product of its (nonzero) digits is 145152, while the sum is 41.
The spelling of 73108642361 in words is "seventy-three billion, one hundred eight million, six hundred forty-two thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •