Base | Representation |
---|---|
bin | 1010001110001011… |
… | …11010000101000001 |
3 | 112011110001221210000 |
4 | 11013011322011001 |
5 | 42214322320431 |
6 | 2304312230213 |
7 | 252663444144 |
oct | 50705720501 |
9 | 15143057700 |
10 | 5487698241 |
11 | 2366731a03 |
12 | 109199b369 |
13 | 695bc752c |
14 | 3a0b7405b |
15 | 221b8e9e6 |
hex | 14717a141 |
5487698241 has 15 divisors (see below), whose sum is σ = 8198668753. Its totient is φ = 3658021020.
The previous prime is 5487698231. The next prime is 5487698257. The reversal of 5487698241 is 1428967845.
It is a happy number.
The square root of 5487698241 is 74079.
It is a perfect power (a square), and thus also a powerful number.
5487698241 is a `hidden beast` number, since 548 + 7 + 6 + 98 + 2 + 4 + 1 = 666.
It is not a de Polignac number, because 5487698241 - 27 = 5487698113 is a prime.
It is a super-3 number, since 3×54876982413 (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5487698201) by changing a digit.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 662596 + ... + 670826.
Almost surely, 25487698241 is an apocalyptic number.
5487698241 is the 74079-th square number.
5487698241 is the 37040-th centered octagonal number.
It is an amenable number.
5487698241 is a deficient number, since it is larger than the sum of its proper divisors (2710970512).
5487698241 is an frugal number, since it uses more digits than its factorization.
5487698241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16474 (or 8234 counting only the distinct ones).
The product of its digits is 3870720, while the sum is 54.
The cubic root of 5487698241 is about 1763.8571399647.
The spelling of 5487698241 in words is "five billion, four hundred eighty-seven million, six hundred ninety-eight thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •