Base | Representation |
---|---|
bin | 110000001101100010… |
… | …0101010101000011111 |
3 | 100220020102101211120020 |
4 | 1200123010222220133 |
5 | 3144014024020020 |
6 | 115321304323223 |
7 | 10323440401452 |
oct | 1403304525037 |
9 | 326212354506 |
10 | 103533423135 |
11 | 3a9a9a1120a |
12 | 18095173513 |
13 | 99bc87c16c |
14 | 502243d499 |
15 | 2a5e549c40 |
hex | 181b12aa1f |
103533423135 has 32 divisors (see below), whose sum is σ = 166980264960. Its totient is φ = 54776711808.
The previous prime is 103533423113. The next prime is 103533423139. The reversal of 103533423135 is 531324335301.
It is not a de Polignac number, because 103533423135 - 220 = 103532374559 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103533423096 and 103533423105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103533423139) 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 31 ways as a sum of consecutive naturals, for example, 1422234 + ... + 1493256.
It is an arithmetic number, because the mean of its divisors is an integer number (5218133280).
Almost surely, 2103533423135 is an apocalyptic number.
103533423135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
103533423135 is a deficient number, since it is larger than the sum of its proper divisors (63446841825).
103533423135 is a wasteful number, since it uses less digits than its factorization.
103533423135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71807.
The product of its (nonzero) digits is 48600, while the sum is 33.
Adding to 103533423135 its reverse (531324335301), we get a palindrome (634857758436).
The spelling of 103533423135 in words is "one hundred three billion, five hundred thirty-three million, four hundred twenty-three thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •