Base | Representation |
---|---|
bin | 101100010001011… |
… | …0110110111100110 |
3 | 10211112021212200122 |
4 | 1120202312313212 |
5 | 11020244021041 |
6 | 403224041542 |
7 | 51545550653 |
oct | 13042666746 |
9 | 3745255618 |
10 | 1485532646 |
11 | 6a25a9734 |
12 | 3556032b2 |
13 | 1a89c8200 |
14 | 101418c2a |
15 | 8a63cc4b |
hex | 588b6de6 |
1485532646 has 12 divisors (see below), whose sum is σ = 2412892332. Its totient is φ = 685630296.
The previous prime is 1485532637. The next prime is 1485532649. The reversal of 1485532646 is 6462355841.
It is a super-2 number, since 2×14855326462 = 4413614484663522632, which contains 22 as substring.
It is a Smith number, since the sum of its digits (44) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 1485532597 and 1485532606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1485532649) 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 5 ways as a sum of consecutive naturals, for example, 2197196 + ... + 2197871.
It is an arithmetic number, because the mean of its divisors is an integer number (201074361).
Almost surely, 21485532646 is an apocalyptic number.
1485532646 is a deficient number, since it is larger than the sum of its proper divisors (927359686).
1485532646 is a wasteful number, since it uses less digits than its factorization.
1485532646 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4395095 (or 4395082 counting only the distinct ones).
The product of its digits is 691200, while the sum is 44.
The square root of 1485532646 is about 38542.6081888603. The cubic root of 1485532646 is about 1141.0221278094.
The spelling of 1485532646 in words is "one billion, four hundred eighty-five million, five hundred thirty-two thousand, six hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •