Base | Representation |
---|---|
bin | 111111000111100011… |
… | …1001001110101010111 |
3 | 110221212100211121020022 |
4 | 1332033013021311113 |
5 | 4210044010101401 |
6 | 142133555455355 |
7 | 12535634342612 |
oct | 1761707116527 |
9 | 427770747208 |
10 | 135545003351 |
11 | 5253669122a |
12 | 223298b755b |
13 | ca219144c4 |
14 | 67bbab9179 |
15 | 37d4a7271b |
hex | 1f8f1c9d57 |
135545003351 has 4 divisors (see below), whose sum is σ = 136520147400. Its totient is φ = 134569859304.
The previous prime is 135545003339. The next prime is 135545003389. The reversal of 135545003351 is 153300545531.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 153300545531 = 7 ⋅21900077933.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135545003351 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135545003311) 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, 487571816 + ... + 487572093.
It is an arithmetic number, because the mean of its divisors is an integer number (34130036850).
Almost surely, 2135545003351 is an apocalyptic number.
135545003351 is a deficient number, since it is larger than the sum of its proper divisors (975144049).
135545003351 is an equidigital number, since it uses as much as digits as its factorization.
135545003351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 975144048.
The product of its (nonzero) digits is 67500, while the sum is 35.
Adding to 135545003351 its reverse (153300545531), we get a palindrome (288845548882).
The spelling of 135545003351 in words is "one hundred thirty-five billion, five hundred forty-five million, three thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •