Base | Representation |
---|---|
bin | 101111111110111011… |
… | …1110001100001100111 |
3 | 100211222021112101011122 |
4 | 1133331313301201213 |
5 | 3142013114113411 |
6 | 115200523524155 |
7 | 10305341222453 |
oct | 1377567614147 |
9 | 324867471148 |
10 | 103043504231 |
11 | 3a77840a958 |
12 | 17b7908965b |
13 | 9942216815 |
14 | 4db734d663 |
15 | 2a315239db |
hex | 17fddf1867 |
103043504231 has 8 divisors (see below), whose sum is σ = 105036259104. Its totient is φ = 101065789440.
The previous prime is 103043504173. The next prime is 103043504273. The reversal of 103043504231 is 132405340301.
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-103043504231 is a prime.
It is a super-2 number, since 2×1030435042312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103043504231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103043504281) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3746186 + ... + 3773591.
It is an arithmetic number, because the mean of its divisors is an integer number (13129532388).
Almost surely, 2103043504231 is an apocalyptic number.
103043504231 is a deficient number, since it is larger than the sum of its proper divisors (1992754873).
103043504231 is an equidigital number, since it uses as much as digits as its factorization.
103043504231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7520041.
The product of its (nonzero) digits is 4320, while the sum is 26.
Adding to 103043504231 its reverse (132405340301), we get a palindrome (235448844532).
The spelling of 103043504231 in words is "one hundred three billion, forty-three million, five hundred four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •