Base | Representation |
---|---|
bin | 101100010001010… |
… | …0100001100001111 |
3 | 10211112010222202012 |
4 | 1120202210030033 |
5 | 11020234044033 |
6 | 403222251435 |
7 | 51545111633 |
oct | 13042441417 |
9 | 3745128665 |
10 | 1485456143 |
11 | 6a2557206 |
12 | 355586b7b |
13 | 1a899c442 |
14 | 1013d8dc3 |
15 | 8a625248 |
hex | 588a430f |
1485456143 has 2 divisors, whose sum is σ = 1485456144. Its totient is φ = 1485456142.
The previous prime is 1485456139. The next prime is 1485456223. The reversal of 1485456143 is 3416545841.
It is a weak prime.
It is an emirp because it is prime and its reverse (3416545841) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1485456143 - 22 = 1485456139 is a prime.
It is a super-3 number, since 3×14854561433 (a number of 28 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1485456143.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1485456943) 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 as a sum of consecutive naturals, namely, 742728071 + 742728072.
It is an arithmetic number, because the mean of its divisors is an integer number (742728072).
Almost surely, 21485456143 is an apocalyptic number.
1485456143 is a deficient number, since it is larger than the sum of its proper divisors (1).
1485456143 is an equidigital number, since it uses as much as digits as its factorization.
1485456143 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 230400, while the sum is 41.
The square root of 1485456143 is about 38541.6157289753. The cubic root of 1485456143 is about 1141.0025404211.
The spelling of 1485456143 in words is "one billion, four hundred eighty-five million, four hundred fifty-six thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •