Base | Representation |
---|---|
bin | 1010010001011001… |
… | …10000101011000001 |
3 | 112020022210210002212 |
4 | 11020230300223001 |
5 | 42243223114140 |
6 | 2311114151505 |
7 | 253441561352 |
oct | 51054605301 |
9 | 15208723085 |
10 | 5514660545 |
11 | 237a9780a9 |
12 | 109aa22595 |
13 | 69b677964 |
14 | 3a4591d29 |
15 | 224218765 |
hex | 148b30ac1 |
5514660545 has 4 divisors (see below), whose sum is σ = 6617592660. Its totient is φ = 4411728432.
The previous prime is 5514660521. The next prime is 5514660611. The reversal of 5514660545 is 5450664155.
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 682881424 + 4831779121 = 26132^2 + 69511^2 .
It is a cyclic number.
It is not a de Polignac number, because 5514660545 - 224 = 5497883329 is a prime.
It is a super-2 number, since 2×55146605452 = 60822961853159394050, which contains 22 as substring.
It is an unprimeable number.
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, 551466050 + ... + 551466059.
It is an arithmetic number, because the mean of its divisors is an integer number (1654398165).
Almost surely, 25514660545 is an apocalyptic number.
It is an amenable number.
5514660545 is a deficient number, since it is larger than the sum of its proper divisors (1102932115).
5514660545 is a wasteful number, since it uses less digits than its factorization.
5514660545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1102932114.
The product of its (nonzero) digits is 360000, while the sum is 41.
The square root of 5514660545 is about 74260.7604660766. The cubic root of 5514660545 is about 1766.7411649887.
The spelling of 5514660545 in words is "five billion, five hundred fourteen million, six hundred sixty thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •