Base | Representation |
---|---|
bin | 101100010000101… |
… | …1000101110100001 |
3 | 10211111120021201222 |
4 | 1120201120232201 |
5 | 11020144201131 |
6 | 403211504425 |
7 | 51542353520 |
oct | 13041305641 |
9 | 3744507658 |
10 | 1485147041 |
11 | 6a2365a54 |
12 | 355458115 |
13 | 1a88c1841 |
14 | 1013584b7 |
15 | 8a5b387b |
hex | 58858ba1 |
1485147041 has 4 divisors (see below), whose sum is σ = 1697310912. Its totient is φ = 1272983172.
The previous prime is 1485147023. The next prime is 1485147071. The reversal of 1485147041 is 1407415841.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1485147041 - 210 = 1485146017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1485146992 and 1485147010.
It is not an unprimeable number, because it can be changed into a prime (1485147011) 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 3 ways as a sum of consecutive naturals, for example, 106081925 + ... + 106081938.
It is an arithmetic number, because the mean of its divisors is an integer number (424327728).
Almost surely, 21485147041 is an apocalyptic number.
It is an amenable number.
1485147041 is a deficient number, since it is larger than the sum of its proper divisors (212163871).
1485147041 is an equidigital number, since it uses as much as digits as its factorization.
1485147041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212163870.
The product of its (nonzero) digits is 17920, while the sum is 35.
The square root of 1485147041 is about 38537.6055431575. The cubic root of 1485147041 is about 1140.9233928734.
The spelling of 1485147041 in words is "one billion, four hundred eighty-five million, one hundred forty-seven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •