Base | Representation |
---|---|
bin | 111110111101100001… |
… | …1101010111010110100 |
3 | 110220222220201210110220 |
4 | 1331323003222322310 |
5 | 4203401341432342 |
6 | 142040340214340 |
7 | 12524410451403 |
oct | 1757303527264 |
9 | 426886653426 |
10 | 135208545972 |
11 | 52383776885 |
12 | 2225509a3b0 |
13 | c999cc04b6 |
14 | 678913563a |
15 | 37b52615ec |
hex | 1f7b0eaeb4 |
135208545972 has 12 divisors (see below), whose sum is σ = 315486607296. Its totient is φ = 45069515320.
The previous prime is 135208545971. The next prime is 135208546021. The reversal of 135208545972 is 279545802531.
It is a tau number, because it is divible by the number of its divisors (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135208545971) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5633689404 + ... + 5633689427.
It is an arithmetic number, because the mean of its divisors is an integer number (26290550608).
Almost surely, 2135208545972 is an apocalyptic number.
135208545972 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
135208545972 is an abundant number, since it is smaller than the sum of its proper divisors (180278061324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135208545972 is a wasteful number, since it uses less digits than its factorization.
135208545972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11267378838 (or 11267378836 counting only the distinct ones).
The product of its (nonzero) digits is 3024000, while the sum is 51.
The spelling of 135208545972 in words is "one hundred thirty-five billion, two hundred eight million, five hundred forty-five thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •