Base | Representation |
---|---|
bin | 111110111000100101… |
… | …0000110111101010001 |
3 | 110220120100012211102221 |
4 | 1331301022012331101 |
5 | 4203031332232041 |
6 | 142012044341041 |
7 | 12520322661232 |
oct | 1756112067521 |
9 | 426510184387 |
10 | 135042461521 |
11 | 522a8a49100 |
12 | 22209544781 |
13 | c97177c486 |
14 | 6771061089 |
15 | 37a58a62d1 |
hex | 1f71286f51 |
135042461521 has 24 divisors (see below), whose sum is σ = 148890568680. Its totient is φ = 122389893120.
The previous prime is 135042461507. The next prime is 135042461527. The reversal of 135042461521 is 125164240531.
It can be written as a sum of positive squares in 4 ways, for example, as 18160527121 + 116881934400 = 134761^2 + 341880^2 .
It is not a de Polignac number, because 135042461521 - 221 = 135040364369 is a prime.
It is a super-3 number, since 3×1350424615213 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (135042461527) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 95842065 + ... + 95843473.
It is an arithmetic number, because the mean of its divisors is an integer number (6203773695).
Almost surely, 2135042461521 is an apocalyptic number.
135042461521 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
135042461521 is a deficient number, since it is larger than the sum of its proper divisors (13848107159).
135042461521 is a wasteful number, since it uses less digits than its factorization.
135042461521 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3297 (or 3286 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 34.
The spelling of 135042461521 in words is "one hundred thirty-five billion, forty-two million, four hundred sixty-one thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •