Base | Representation |
---|---|
bin | 11110111010010100010000… |
… | …111110111000011100011000 |
3 | 122211100120211112011120202020 |
4 | 132322110100332320130120 |
5 | 120304341303443133424 |
6 | 1201050015551334440 |
7 | 40430661045525630 |
oct | 3672242076703430 |
9 | 584316745146666 |
10 | 135948884739864 |
11 | 3a35466428a139 |
12 | 132b797a521420 |
13 | 5ab1c03ab0711 |
14 | 257dd654a96c0 |
15 | 10ab520cde079 |
hex | 7ba510fb8718 |
135948884739864 has 64 divisors (see below), whose sum is σ = 411273937036800. Its totient is φ = 36557683290624.
The previous prime is 135948884739821. The next prime is 135948884739919. The reversal of 135948884739864 is 468937488849531.
135948884739864 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
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, 23800572204 + ... + 23800577915.
It is an arithmetic number, because the mean of its divisors is an integer number (6426155266200).
Almost surely, 2135948884739864 is an apocalyptic number.
135948884739864 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
135948884739864 is an abundant number, since it is smaller than the sum of its proper divisors (275325052296936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135948884739864 is a wasteful number, since it uses less digits than its factorization.
135948884739864 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47601150152 (or 47601150148 counting only the distinct ones).
The product of its digits is 40131624960, while the sum is 87.
The spelling of 135948884739864 in words is "one hundred thirty-five trillion, nine hundred forty-eight billion, eight hundred eighty-four million, seven hundred thirty-nine thousand, eight hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •