Base | Representation |
---|---|
bin | 11110101110100110110001… |
… | …100100001100001101000000 |
3 | 122201111122121102210011202022 |
4 | 132232212301210030031000 |
5 | 120203200132001214130 |
6 | 1155232204241541012 |
7 | 40315561255021310 |
oct | 3656466144141500 |
9 | 581448542704668 |
10 | 135144125023040 |
11 | 3a074335414781 |
12 | 131a7a06044768 |
13 | 5a540619c5173 |
14 | 2553020d4d440 |
15 | 109561ec0a7e5 |
hex | 7ae9b190c340 |
135144125023040 has 112 divisors (see below), whose sum is σ = 389419499860992. Its totient is φ = 43609532768256.
The previous prime is 135144125023007. The next prime is 135144125023109. The reversal of 135144125023040 is 40320521441531.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1774438352 + ... + 1774514511.
Almost surely, 2135144125023040 is an apocalyptic number.
135144125023040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
135144125023040 is an abundant number, since it is smaller than the sum of its proper divisors (254275374837952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135144125023040 is a wasteful number, since it uses less digits than its factorization.
135144125023040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3548952904 (or 3548952894 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 135144125023040 its reverse (40320521441531), we get a palindrome (175464646464571).
The spelling of 135144125023040 in words is "one hundred thirty-five trillion, one hundred forty-four billion, one hundred twenty-five million, twenty-three thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •