Base | Representation |
---|---|
bin | 11110000010010100000000… |
… | …000111001010100100000000 |
3 | 122022201122222210200222121220 |
4 | 132002110000013022210000 |
5 | 114303312414104020334 |
6 | 1144542013423515040 |
7 | 36552634565514510 |
oct | 3602240007124400 |
9 | 568648883628556 |
10 | 132100311001344 |
11 | 39100477792014 |
12 | 12995b12a58a80 |
13 | 589300cba934a |
14 | 2489991107840 |
15 | 1041373c44449 |
hex | 7825001ca900 |
132100311001344 has 144 divisors (see below), whose sum is σ = 412664710889088. Its totient is φ = 36722866323456.
The previous prime is 132100311001301. The next prime is 132100311001357. The reversal of 132100311001344 is 443100113001231.
It is a happy number.
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 15 ways as a sum of consecutive naturals, for example, 331858257 + ... + 332256080.
It is an arithmetic number, because the mean of its divisors is an integer number (2865727158952).
Almost surely, 2132100311001344 is an apocalyptic number.
132100311001344 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
132100311001344 is an abundant number, since it is smaller than the sum of its proper divisors (280564399887744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132100311001344 is an equidigital number, since it uses as much as digits as its factorization.
132100311001344 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 664114400 (or 664114386 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 132100311001344 its reverse (443100113001231), we get a palindrome (575200424002575).
The spelling of 132100311001344 in words is "one hundred thirty-two trillion, one hundred billion, three hundred eleven million, one thousand, three hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •