Base | Representation |
---|---|
bin | 1110100110100… |
… | …1001000101101 |
3 | 11021020201112010 |
4 | 3221221020231 |
5 | 111134414140 |
6 | 10024431433 |
7 | 1342412505 |
oct | 351511055 |
9 | 137221463 |
10 | 61248045 |
11 | 31633621 |
12 | 18618579 |
13 | c8c6061 |
14 | 81c4a05 |
15 | 559c880 |
hex | 3a6922d |
61248045 has 8 divisors (see below), whose sum is σ = 97996896. Its totient is φ = 32665616.
The previous prime is 61248017. The next prime is 61248049. The reversal of 61248045 is 54084216.
61248045 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 61248045 - 27 = 61247917 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61248049) 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 7 ways as a sum of consecutive naturals, for example, 2041587 + ... + 2041616.
It is an arithmetic number, because the mean of its divisors is an integer number (12249612).
Almost surely, 261248045 is an apocalyptic number.
It is an amenable number.
61248045 is a deficient number, since it is larger than the sum of its proper divisors (36748851).
61248045 is a wasteful number, since it uses less digits than its factorization.
61248045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4083211.
The product of its (nonzero) digits is 7680, while the sum is 30.
The square root of 61248045 is about 7826.1130198841. The cubic root of 61248045 is about 394.1825641781.
It can be divided in two parts, 612480 and 45, that multiplied together give a triangular number (27561600 = T7424).
The spelling of 61248045 in words is "sixty-one million, two hundred forty-eight thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •