Base | Representation |
---|---|
bin | 111001000001110010… |
… | …001011100101100101 |
3 | 12212001110002122212011 |
4 | 321001302023211211 |
5 | 2000401200401340 |
6 | 44044040154221 |
7 | 4265262514114 |
oct | 710162134545 |
9 | 185043078764 |
10 | 61233215845 |
11 | 23a7261040a |
12 | ba4aa68971 |
13 | 5a0b0b12c9 |
14 | 2d6c58bc7b |
15 | 18d5b500ea |
hex | e41c8b965 |
61233215845 has 4 divisors (see below), whose sum is σ = 73479859020. Its totient is φ = 48986572672.
The previous prime is 61233215843. The next prime is 61233215851. The reversal of 61233215845 is 54851233216.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 44520156004 + 16713059841 = 210998^2 + 129279^2 .
It is a cyclic number.
It is not a de Polignac number, because 61233215845 - 21 = 61233215843 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 61233215798 and 61233215807.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61233215843) 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, 6123321580 + ... + 6123321589.
It is an arithmetic number, because the mean of its divisors is an integer number (18369964755).
Almost surely, 261233215845 is an apocalyptic number.
It is an amenable number.
61233215845 is a deficient number, since it is larger than the sum of its proper divisors (12246643175).
61233215845 is a wasteful number, since it uses less digits than its factorization.
61233215845 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12246643174.
The product of its digits is 172800, while the sum is 40.
The spelling of 61233215845 in words is "sixty-one billion, two hundred thirty-three million, two hundred fifteen thousand, eight hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •