Base | Representation |
---|---|
bin | 111111000110111100… |
… | …1011001110101010011 |
3 | 110221210221111002210112 |
4 | 1332031321121311103 |
5 | 4210023300343101 |
6 | 142131550551535 |
7 | 12535266164006 |
oct | 1761571316523 |
9 | 427727432715 |
10 | 135524621651 |
11 | 52526130151 |
12 | 22322b085ab |
13 | ca1a629423 |
14 | 67b90d153d |
15 | 37d2d986bb |
hex | 1f8de59d53 |
135524621651 has 2 divisors, whose sum is σ = 135524621652. Its totient is φ = 135524621650.
The previous prime is 135524621633. The next prime is 135524621699. The reversal of 135524621651 is 156126425531.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135524621651 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 135524621599 and 135524621608.
It is not a weakly prime, because it can be changed into another prime (135524621611) 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 as a sum of consecutive naturals, namely, 67762310825 + 67762310826.
It is an arithmetic number, because the mean of its divisors is an integer number (67762310826).
Almost surely, 2135524621651 is an apocalyptic number.
135524621651 is a deficient number, since it is larger than the sum of its proper divisors (1).
135524621651 is an equidigital number, since it uses as much as digits as its factorization.
135524621651 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 216000, while the sum is 41.
The spelling of 135524621651 in words is "one hundred thirty-five billion, five hundred twenty-four million, six hundred twenty-one thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •