Base | Representation |
---|---|
bin | 111101010000100011… |
… | …1010100010001100000 |
3 | 110120120002102111121220 |
4 | 1322201013110101200 |
5 | 4123404312144304 |
6 | 140233441215040 |
7 | 12334661064000 |
oct | 1724107242140 |
9 | 416502374556 |
10 | 131552068704 |
11 | 50877793341 |
12 | 215b4631480 |
13 | c5365c7994 |
14 | 651d684000 |
15 | 364e245ad9 |
hex | 1ea11d4460 |
131552068704 has 192 divisors, whose sum is σ = 408727872000. Its totient is φ = 37024694784.
The previous prime is 131552068667. The next prime is 131552068723. The reversal of 131552068704 is 407860255131.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2176362 + ... + 2235990.
It is an arithmetic number, because the mean of its divisors is an integer number (2128791000).
Almost surely, 2131552068704 is an apocalyptic number.
131552068704 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 131552068704, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (204363936000).
131552068704 is an abundant number, since it is smaller than the sum of its proper divisors (277175803296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131552068704 is an equidigital number, since it uses as much as digits as its factorization.
131552068704 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59730 (or 59708 counting only the distinct ones).
The product of its (nonzero) digits is 201600, while the sum is 42.
The spelling of 131552068704 in words is "one hundred thirty-one billion, five hundred fifty-two million, sixty-eight thousand, seven hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •