Base | Representation |
---|---|
bin | 1010100001010000… |
… | …01010111100000101 |
3 | 112120121002121211101 |
4 | 11100220022330011 |
5 | 43031301101031 |
6 | 2332225140101 |
7 | 256645306123 |
oct | 52050127405 |
9 | 15517077741 |
10 | 5647675141 |
11 | 2438a68a19 |
12 | 111748a631 |
13 | 6c00aa614 |
14 | 3b80d8913 |
15 | 230c40361 |
hex | 150a0af05 |
5647675141 has 8 divisors (see below), whose sum is σ = 5694474240. Its totient is φ = 5600912688.
The previous prime is 5647675129. The next prime is 5647675171. The reversal of 5647675141 is 1415767465.
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 5647675141 - 213 = 5647666949 is a prime.
It is a Duffinian number.
It is a zygodrome in base 4.
It is a junction number, because it is equal to n+sod(n) for n = 5647675091 and 5647675100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5647675171) 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, 361800 + ... + 377086.
It is an arithmetic number, because the mean of its divisors is an integer number (711809280).
Almost surely, 25647675141 is an apocalyptic number.
It is an amenable number.
5647675141 is a deficient number, since it is larger than the sum of its proper divisors (46799099).
5647675141 is a wasteful number, since it uses less digits than its factorization.
5647675141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18323.
The product of its digits is 705600, while the sum is 46.
The square root of 5647675141 is about 75151.0155686535. The cubic root of 5647675141 is about 1780.8331685346.
The spelling of 5647675141 in words is "five billion, six hundred forty-seven million, six hundred seventy-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •