Base | Representation |
---|---|
bin | 11111001011111101100111… |
… | …101111111111101101110000 |
3 | 122222122111212020200001011210 |
4 | 133023331213233333231300 |
5 | 120434223243413422002 |
6 | 1203415044420040120 |
7 | 40614410234615052 |
oct | 3713754757775560 |
9 | 588574766601153 |
10 | 137161521232752 |
11 | 3a781968a40385 |
12 | 134729a3b33040 |
13 | 5b6c378364c43 |
14 | 25c291dd778d2 |
15 | 10ccd4507596c |
hex | 7cbf67bffb70 |
137161521232752 has 80 divisors (see below), whose sum is σ = 371616605015040. Its totient is φ = 43510665682176.
The previous prime is 137161521232751. The next prime is 137161521232819. The reversal of 137161521232752 is 257232125161731.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (137161521232751) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 315113752 + ... + 315548727.
It is an arithmetic number, because the mean of its divisors is an integer number (4645207562688).
Almost surely, 2137161521232752 is an apocalyptic number.
137161521232752 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
137161521232752 is an abundant number, since it is smaller than the sum of its proper divisors (234455083782288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
137161521232752 is a wasteful number, since it uses less digits than its factorization.
137161521232752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 630662710 (or 630662704 counting only the distinct ones).
The product of its digits is 1058400, while the sum is 48.
The spelling of 137161521232752 in words is "one hundred thirty-seven trillion, one hundred sixty-one billion, five hundred twenty-one million, two hundred thirty-two thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •