Base | Representation |
---|---|
bin | 111110111000111100… |
… | …0100111110000111000 |
3 | 110220121012011022002111 |
4 | 1331301320213300320 |
5 | 4203042442421040 |
6 | 142013201542104 |
7 | 12520531423312 |
oct | 1756170476070 |
9 | 426535138074 |
10 | 135054654520 |
11 | 52304916965 |
12 | 22211644934 |
13 | c97415b276 |
14 | 67729167b2 |
15 | 37a69b3dea |
hex | 1f71e27c38 |
135054654520 has 16 divisors (see below), whose sum is σ = 303872972760. Its totient is φ = 54021861792.
The previous prime is 135054654499. The next prime is 135054654521. The reversal of 135054654520 is 25456450531.
It is a super-3 number, since 3×1350546545203 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (40), and also a Moran number because the ratio is a prime number: 3376366363 = 135054654520 / (1 + 3 + 5 + 0 + 5 + 4 + 6 + 5 + 4 + 5 + 2 + 0).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135054654521) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1688183142 + ... + 1688183221.
Almost surely, 2135054654520 is an apocalyptic number.
135054654520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
135054654520 is an abundant number, since it is smaller than the sum of its proper divisors (168818318240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135054654520 is a wasteful number, since it uses less digits than its factorization.
135054654520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3376366374 (or 3376366370 counting only the distinct ones).
The product of its (nonzero) digits is 360000, while the sum is 40.
The spelling of 135054654520 in words is "one hundred thirty-five billion, fifty-four million, six hundred fifty-four thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •