Base | Representation |
---|---|
bin | 110000001010011111… |
… | …0001100001110110001 |
3 | 100212222021210101002201 |
4 | 1200110332030032301 |
5 | 3143311322444244 |
6 | 115303210343201 |
7 | 10321055345011 |
oct | 1402476141661 |
9 | 325867711081 |
10 | 103431062449 |
11 | 3a957158100 |
12 | 18066a2ab01 |
13 | 99a45c0000 |
14 | 50129d5c41 |
15 | 2a5557aad4 |
hex | 1814f8c3b1 |
103431062449 has 45 divisors (see below), whose sum is σ = 123878450759. Its totient is φ = 86293590240.
The previous prime is 103431062429. The next prime is 103431062459. The reversal of 103431062449 is 944260134301.
The square root of 103431062449 is 321607.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 7 ways, for example, as 81011390625 + 22419671824 = 284625^2 + 149732^2 .
It is not a de Polignac number, because 103431062449 - 27 = 103431062321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103431062429) 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 44 ways as a sum of consecutive naturals, for example, 597867327 + ... + 597867499.
Almost surely, 2103431062449 is an apocalyptic number.
103431062449 is the 321607-th square number.
103431062449 is the 160804-th centered octagonal number.
It is an amenable number.
103431062449 is a deficient number, since it is larger than the sum of its proper divisors (20447388310).
103431062449 is an frugal number, since it uses more digits than its factorization.
103431062449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 420 (or 197 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 37.
The spelling of 103431062449 in words is "one hundred three billion, four hundred thirty-one million, sixty-two thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •