Base | Representation |
---|---|
bin | 11110000011110010110101… |
… | …000100001011001100011000 |
3 | 122100002101210211021000122021 |
4 | 132003302311010023030120 |
5 | 114311444431033011100 |
6 | 1145100453130504224 |
7 | 36563201023442005 |
oct | 3603626504131430 |
9 | 570071724230567 |
10 | 132202131141400 |
11 | 3913a6775882a1 |
12 | 129b17aa295074 |
13 | 589c7b880ac28 |
14 | 249088dba48ac |
15 | 1043d32b64a1a |
hex | 783cb510b318 |
132202131141400 has 48 divisors (see below), whose sum is σ = 307387080253440. Its totient is φ = 52877906160000.
The previous prime is 132202131141359. The next prime is 132202131141419. The reversal of 132202131141400 is 4141131202231.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14813976 + ... + 21996775.
It is an arithmetic number, because the mean of its divisors is an integer number (6403897505280).
Almost surely, 2132202131141400 is an apocalyptic number.
132202131141400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132202131141400 is an abundant number, since it is smaller than the sum of its proper divisors (175184949112040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132202131141400 is a wasteful number, since it uses less digits than its factorization.
132202131141400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36828724 (or 36828715 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 132202131141400 its reverse (4141131202231), we get a palindrome (136343262343631).
The spelling of 132202131141400 in words is "one hundred thirty-two trillion, two hundred two billion, one hundred thirty-one million, one hundred forty-one thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.945 sec. • engine limits •