Base | Representation |
---|---|
bin | 1110100100001… |
… | …1010001000101 |
3 | 11020221211202020 |
4 | 3221003101011 |
5 | 111114433213 |
6 | 10021233353 |
7 | 1341165336 |
oct | 351032105 |
9 | 136854666 |
10 | 61092933 |
11 | 31538030 |
12 | 18562859 |
13 | c870585 |
14 | 818428d |
15 | 556b923 |
hex | 3a43445 |
61092933 has 8 divisors (see below), whose sum is σ = 88862496. Its totient is φ = 37026000.
The previous prime is 61092919. The next prime is 61092943. The reversal of 61092933 is 33929016.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 61092933 - 25 = 61092901 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 1851301 = 61092933 / (6 + 1 + 0 + 9 + 2 + 9 + 3 + 3).
It is a junction number, because it is equal to n+sod(n) for n = 61092894 and 61092903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61092943) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 925618 + ... + 925683.
It is an arithmetic number, because the mean of its divisors is an integer number (11107812).
Almost surely, 261092933 is an apocalyptic number.
It is an amenable number.
61092933 is a deficient number, since it is larger than the sum of its proper divisors (27769563).
61092933 is a wasteful number, since it uses less digits than its factorization.
61092933 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1851315.
The product of its (nonzero) digits is 8748, while the sum is 33.
The square root of 61092933 is about 7816.1968373372. The cubic root of 61092933 is about 393.8495242500.
The spelling of 61092933 in words is "sixty-one million, ninety-two thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •