Base | Representation |
---|---|
bin | 1010100001111100… |
… | …00101110001011011 |
3 | 112120222220112212102 |
4 | 11100332011301123 |
5 | 43034233434042 |
6 | 2332552234015 |
7 | 260045200253 |
oct | 52076056133 |
9 | 15528815772 |
10 | 5653421147 |
11 | 2441232a90 |
12 | 111939b90b |
13 | 6c133cb1a |
14 | 3b8b92963 |
15 | 2314c7b32 |
hex | 150f85c5b |
5653421147 has 8 divisors (see below), whose sum is σ = 6245437440. Its totient is φ = 5074416360.
The previous prime is 5653421143. The next prime is 5653421159. The reversal of 5653421147 is 7411243565.
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 5653421147 - 22 = 5653421143 is a prime.
It is a super-2 number, since 2×56534211472 = 63922341330693591218, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5653421147.
It is not an unprimeable number, because it can be changed into a prime (5653421143) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 3251963 + ... + 3253700.
It is an arithmetic number, because the mean of its divisors is an integer number (780679680).
Almost surely, 25653421147 is an apocalyptic number.
5653421147 is a deficient number, since it is larger than the sum of its proper divisors (592016293).
5653421147 is a wasteful number, since it uses less digits than its factorization.
5653421147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6505753.
The product of its digits is 100800, while the sum is 38.
The square root of 5653421147 is about 75189.2355793035. The cubic root of 5653421147 is about 1781.4369101626.
The spelling of 5653421147 in words is "five billion, six hundred fifty-three million, four hundred twenty-one thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •