Base | Representation |
---|---|
bin | 11101110101100001011001… |
… | …011000000111000111001000 |
3 | 122012121122012211021222122220 |
4 | 131311201121120013013020 |
5 | 114144412301110221300 |
6 | 1143030130155414040 |
7 | 36432300066142464 |
oct | 3565413130070710 |
9 | 565548184258586 |
10 | 131221340320200 |
11 | 388a172674a789 |
12 | 128736a9454320 |
13 | 582b17212bca0 |
14 | 245920a9c74a4 |
15 | 102857ca06da0 |
hex | 7758596071c8 |
131221340320200 has 96 divisors (see below), whose sum is σ = 438077397710400. Its totient is φ = 32300637615360.
The previous prime is 131221340320157. The next prime is 131221340320211. The reversal of 131221340320200 is 2023043122131.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8411616580 + ... + 8411632179.
It is an arithmetic number, because the mean of its divisors is an integer number (4563306226150).
Almost surely, 2131221340320200 is an apocalyptic number.
131221340320200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131221340320200 is an abundant number, since it is smaller than the sum of its proper divisors (306856057390200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131221340320200 is a wasteful number, since it uses less digits than its factorization.
131221340320200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16823248791 (or 16823248782 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 131221340320200 its reverse (2023043122131), we get a palindrome (133244383442331).
The spelling of 131221340320200 in words is "one hundred thirty-one trillion, two hundred twenty-one billion, three hundred forty million, three hundred twenty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •