Base | Representation |
---|---|
bin | 111111000011010100… |
… | …0110110110101101111 |
3 | 110221111110100010120202 |
4 | 1332012220312311233 |
5 | 4204301111443003 |
6 | 142111520504115 |
7 | 12532260115454 |
oct | 1760650666557 |
9 | 427443303522 |
10 | 135402843503 |
11 | 52473414454 |
12 | 222aa17b03b |
13 | c9cb32c055 |
14 | 67a6c7182b |
15 | 37c7341088 |
hex | 1f86a36d6f |
135402843503 has 4 divisors (see below), whose sum is σ = 135405251808. Its totient is φ = 135400435200.
The previous prime is 135402843463. The next prime is 135402843517. The reversal of 135402843503 is 305348204531.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 305348204531 = 61 ⋅5005708271.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135402843503 is a prime.
It is a super-2 number, since 2×1354028435032 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135402843203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1117751 + ... + 1232952.
It is an arithmetic number, because the mean of its divisors is an integer number (33851312952).
Almost surely, 2135402843503 is an apocalyptic number.
135402843503 is a deficient number, since it is larger than the sum of its proper divisors (2408305).
135402843503 is an equidigital number, since it uses as much as digits as its factorization.
135402843503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2408304.
The product of its (nonzero) digits is 172800, while the sum is 38.
The spelling of 135402843503 in words is "one hundred thirty-five billion, four hundred two million, eight hundred forty-three thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •