Base | Representation |
---|---|
bin | 11110110100001111100011… |
… | …110100001011110101110100 |
3 | 122202212200112022121202221210 |
4 | 132310033203310023311310 |
5 | 120231022020333231200 |
6 | 1200130152444241420 |
7 | 40355554201436346 |
oct | 3664174364136564 |
9 | 582780468552853 |
10 | 135531515133300 |
11 | 3a203657aa22a0 |
12 | 1324aaba240270 |
13 | 5a8174aa1c790 |
14 | 2567a904d5296 |
15 | 10a0744560650 |
hex | 7b43e3d0bd74 |
135531515133300 has 144 divisors (see below), whose sum is σ = 460693418859072. Its totient is φ = 30328730649600.
The previous prime is 135531515133269. The next prime is 135531515133307. The reversal of 135531515133300 is 3331515135531.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135531515133307) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1579578489 + ... + 1579664288.
It is an arithmetic number, because the mean of its divisors is an integer number (3199259853188).
Almost surely, 2135531515133300 is an apocalyptic number.
135531515133300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
135531515133300 is an abundant number, since it is smaller than the sum of its proper divisors (325161903725772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135531515133300 is a wasteful number, since it uses less digits than its factorization.
135531515133300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3159242818 (or 3159242811 counting only the distinct ones).
The product of its (nonzero) digits is 151875, while the sum is 39.
The spelling of 135531515133300 in words is "one hundred thirty-five trillion, five hundred thirty-one billion, five hundred fifteen million, one hundred thirty-three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •