Base | Representation |
---|---|
bin | 111000111111111001… |
… | …010000001001010101 |
3 | 12211222020110002121020 |
4 | 320333321100021111 |
5 | 2000320041440333 |
6 | 44040544511353 |
7 | 4264426203105 |
oct | 707771201125 |
9 | 184866402536 |
10 | 61201515093 |
11 | 23a56729144 |
12 | ba4031b559 |
13 | 5a04662174 |
14 | 2d68299205 |
15 | 18d2e8c3b3 |
hex | e3fe50255 |
61201515093 has 8 divisors (see below), whose sum is σ = 81603164256. Its totient is φ = 40800438000.
The previous prime is 61201515071. The next prime is 61201515127. The reversal of 61201515093 is 39051510216.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 61201515093 - 26 = 61201515029 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61201515013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 332043 + ... + 482343.
It is an arithmetic number, because the mean of its divisors is an integer number (10200395532).
Almost surely, 261201515093 is an apocalyptic number.
It is an amenable number.
61201515093 is a deficient number, since it is larger than the sum of its proper divisors (20401649163).
61201515093 is a wasteful number, since it uses less digits than its factorization.
61201515093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286035.
The product of its (nonzero) digits is 8100, while the sum is 33.
The spelling of 61201515093 in words is "sixty-one billion, two hundred one million, five hundred fifteen thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •