Base | Representation |
---|---|
bin | 1010001101111010… |
… | …10001000100111011 |
3 | 112011021210212122122 |
4 | 11012331101010323 |
5 | 42213232330042 |
6 | 2304151511455 |
7 | 252635261315 |
oct | 50675210473 |
9 | 15137725578 |
10 | 5485433147 |
11 | 2365425127 |
12 | 109108858b |
13 | 6955b353c |
14 | 3a07447b5 |
15 | 2218937d2 |
hex | 146f5113b |
5485433147 has 4 divisors (see below), whose sum is σ = 5485582536. Its totient is φ = 5485283760.
The previous prime is 5485433111. The next prime is 5485433207. The reversal of 5485433147 is 7413345845.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 5485433147 - 212 = 5485429051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5485433098 and 5485433107.
It is not an unprimeable number, because it can be changed into a prime (5485430147) 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 3 ways as a sum of consecutive naturals, for example, 22823 + ... + 107199.
It is an arithmetic number, because the mean of its divisors is an integer number (1371395634).
Almost surely, 25485433147 is an apocalyptic number.
5485433147 is a deficient number, since it is larger than the sum of its proper divisors (149389).
5485433147 is an equidigital number, since it uses as much as digits as its factorization.
5485433147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149388.
The product of its digits is 806400, while the sum is 44.
The square root of 5485433147 is about 74063.7100542499. The cubic root of 5485433147 is about 1763.6144242350.
The spelling of 5485433147 in words is "five billion, four hundred eighty-five million, four hundred thirty-three thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •