Base | Representation |
---|---|
bin | 1001011011011000… |
… | …10100110100101101 |
3 | 111001202012222021010 |
4 | 10231230110310231 |
5 | 40331224433040 |
6 | 2154130455433 |
7 | 236300364330 |
oct | 45554246455 |
9 | 14052188233 |
10 | 5061561645 |
11 | 21681351a8 |
12 | b93134579 |
13 | 6288345ba |
14 | 360328617 |
15 | 1e9566e80 |
hex | 12db14d2d |
5061561645 has 16 divisors (see below), whose sum is σ = 9255427200. Its totient is φ = 2313856704.
The previous prime is 5061561619. The next prime is 5061561667. The reversal of 5061561645 is 5461651605.
5061561645 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5061561645 - 27 = 5061561517 is a prime.
It is a super-3 number, since 3×50615616453 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 24102570 + ... + 24102779.
It is an arithmetic number, because the mean of its divisors is an integer number (578464200).
Almost surely, 25061561645 is an apocalyptic number.
It is an amenable number.
5061561645 is a deficient number, since it is larger than the sum of its proper divisors (4193865555).
5061561645 is a wasteful number, since it uses less digits than its factorization.
5061561645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48205364.
The product of its (nonzero) digits is 108000, while the sum is 39.
The square root of 5061561645 is about 71144.6529614138. The cubic root of 5061561645 is about 1716.9652685504.
The spelling of 5061561645 in words is "five billion, sixty-one million, five hundred sixty-one thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •