Base | Representation |
---|---|
bin | 100110101111100… |
… | …0110110110001111 |
3 | 10100121011211221110 |
4 | 1031133012312033 |
5 | 10130300001033 |
6 | 332555303103 |
7 | 44133550611 |
oct | 11537066617 |
9 | 3317154843 |
10 | 1300000143 |
11 | 6078a8392 |
12 | 30344aa93 |
13 | 179438070 |
14 | c4920db1 |
15 | 791e0363 |
hex | 4d7c6d8f |
1300000143 has 32 divisors (see below), whose sum is σ = 1929227776. Its totient is φ = 773463168.
The previous prime is 1300000103. The next prime is 1300000151. The reversal of 1300000143 is 3410000031.
It is not a de Polignac number, because 1300000143 - 28 = 1299999887 is a prime.
It is a Duffinian number.
1300000143 is a modest number, since divided by 143 gives 13 as remainder.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1300000103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 232446 + ... + 237972.
It is an arithmetic number, because the mean of its divisors is an integer number (60288368).
Almost surely, 21300000143 is an apocalyptic number.
1300000143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1300000143 is a deficient number, since it is larger than the sum of its proper divisors (629227633).
1300000143 is a wasteful number, since it uses less digits than its factorization.
1300000143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5743.
The product of its (nonzero) digits is 36, while the sum is 12.
The square root of 1300000143 is about 36055.5147376930. The cubic root of 1300000143 is about 1091.3929230788.
Adding to 1300000143 its reverse (3410000031), we get a palindrome (4710000174).
The spelling of 1300000143 in words is "one billion, three hundred million, one hundred forty-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •