Base | Representation |
---|---|
bin | 111000111000001110… |
… | …000011000001101111 |
3 | 12211122021011002020220 |
4 | 320320032003001233 |
5 | 2000034110424110 |
6 | 44020104542423 |
7 | 4261303540542 |
oct | 707016030157 |
9 | 184567132226 |
10 | 61072748655 |
11 | 2399aa79aa6 |
12 | ba05181a13 |
13 | 59b3a88cc9 |
14 | 2d5513a859 |
15 | 18c6a04370 |
hex | e3838306f |
61072748655 has 8 divisors (see below), whose sum is σ = 97716397872. Its totient is φ = 32572132608.
The previous prime is 61072748609. The next prime is 61072748657. The reversal of 61072748655 is 55684727016.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 61072748655 - 217 = 61072617583 is a prime.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 61072748598 and 61072748607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61072748657) 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 7 ways as a sum of consecutive naturals, for example, 2035758274 + ... + 2035758303.
It is an arithmetic number, because the mean of its divisors is an integer number (12214549734).
Almost surely, 261072748655 is an apocalyptic number.
61072748655 is a deficient number, since it is larger than the sum of its proper divisors (36643649217).
61072748655 is a wasteful number, since it uses less digits than its factorization.
61072748655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4071516585.
The product of its (nonzero) digits is 2822400, while the sum is 51.
The spelling of 61072748655 in words is "sixty-one billion, seventy-two million, seven hundred forty-eight thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •