Base | Representation |
---|---|
bin | 10000110000000111011111… |
… | …011001111100111011111111 |
3 | 100122212021212212122210210110 |
4 | 100300013133121330323333 |
5 | 34124044024432310110 |
6 | 420405550432241103 |
7 | 21342603110326041 |
oct | 2060073731747377 |
9 | 318767785583713 |
10 | 73675322150655 |
11 | 2152558a707a85 |
12 | 831a9303a0193 |
13 | 3215726122404 |
14 | 1429c943b7a91 |
15 | 87b6e6a56a20 |
hex | 4301df67ceff |
73675322150655 has 64 divisors (see below), whose sum is σ = 126605209651200. Its totient is φ = 36476888371200.
The previous prime is 73675322150621. The next prime is 73675322150659. The reversal of 73675322150655 is 55605122357637.
It is not a de Polignac number, because 73675322150655 - 213 = 73675322142463 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a junction number, because it is equal to n+sod(n) for n = 73675322150595 and 73675322150604.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (73675322150659) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10401175 + ... + 15985464.
It is an arithmetic number, because the mean of its divisors is an integer number (1978206400800).
Almost surely, 273675322150655 is an apocalyptic number.
73675322150655 is a deficient number, since it is larger than the sum of its proper divisors (52929887500545).
73675322150655 is a wasteful number, since it uses less digits than its factorization.
73675322150655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26386864.
The product of its (nonzero) digits is 39690000, while the sum is 57.
The spelling of 73675322150655 in words is "seventy-three trillion, six hundred seventy-five billion, three hundred twenty-two million, one hundred fifty thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •