Base | Representation |
---|---|
bin | 1110100011000… |
… | …0001010101111 |
3 | 11020210212102211 |
4 | 3220300022233 |
5 | 111104432303 |
6 | 10015431251 |
7 | 1340421301 |
oct | 350601257 |
9 | 136725384 |
10 | 61014703 |
11 | 31494282 |
12 | 18525527 |
13 | c843a99 |
14 | 8163971 |
15 | 555366d |
hex | 3a302af |
61014703 has 4 divisors (see below), whose sum is σ = 61034688. Its totient is φ = 60994720.
The previous prime is 61014677. The next prime is 61014743. The reversal of 61014703 is 30741016.
61014703 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 61014703 - 25 = 61014671 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61014743) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4351 + ... + 11872.
It is an arithmetic number, because the mean of its divisors is an integer number (15258672).
Almost surely, 261014703 is an apocalyptic number.
61014703 is a deficient number, since it is larger than the sum of its proper divisors (19985).
61014703 is a wasteful number, since it uses less digits than its factorization.
61014703 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19984.
The product of its (nonzero) digits is 504, while the sum is 22.
The square root of 61014703 is about 7811.1908823175. The cubic root of 61014703 is about 393.6813432657.
Adding to 61014703 its reverse (30741016), we get a palindrome (91755719).
The spelling of 61014703 in words is "sixty-one million, fourteen thousand, seven hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •