Base | Representation |
---|---|
bin | 110000000100100001… |
… | …1110101101110011111 |
3 | 100212110100202011001111 |
4 | 1200021003311232133 |
5 | 3142404142412133 |
6 | 115231311122451 |
7 | 10313110601620 |
oct | 1401103655637 |
9 | 325410664044 |
10 | 103231216543 |
11 | 3a86436a9a4 |
12 | 1800bb13427 |
13 | 997208abb0 |
14 | 4dd4253a47 |
15 | 2a42c521cd |
hex | 18090f5b9f |
103231216543 has 8 divisors (see below), whose sum is σ = 127053805088. Its totient is φ = 81677445984.
The previous prime is 103231216493. The next prime is 103231216547. The reversal of 103231216543 is 345612132301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103231216543 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103231216547) 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 7 ways as a sum of consecutive naturals, for example, 567204396 + ... + 567204577.
It is an arithmetic number, because the mean of its divisors is an integer number (15881725636).
Almost surely, 2103231216543 is an apocalyptic number.
103231216543 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
103231216543 is a deficient number, since it is larger than the sum of its proper divisors (23822588545).
103231216543 is a wasteful number, since it uses less digits than its factorization.
103231216543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1134408993.
The product of its (nonzero) digits is 12960, while the sum is 31.
Adding to 103231216543 its reverse (345612132301), we get a palindrome (448843348844).
The spelling of 103231216543 in words is "one hundred three billion, two hundred thirty-one million, two hundred sixteen thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •