Base | Representation |
---|---|
bin | 11110000010100111011110… |
… | …011001001010110010100100 |
3 | 122022210122221222220212200120 |
4 | 132002213132121022302210 |
5 | 114304133224323211004 |
6 | 1144555352311041540 |
7 | 36554305000266225 |
oct | 3602473631126244 |
9 | 568718858825616 |
10 | 132121220132004 |
11 | 3910932740a394 |
12 | 12999b893702b0 |
13 | 5894c92a265cc |
14 | 248a9b604524c |
15 | 1041b996e23d9 |
hex | 7829de64aca4 |
132121220132004 has 24 divisors (see below), whose sum is σ = 308318848948320. Its totient is φ = 44035263571584.
The previous prime is 132121220132003. The next prime is 132121220132017. The reversal of 132121220132004 is 400231022121231.
It is not an unprimeable number, because it can be changed into a prime (132121220132003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 642785349 + ... + 642990860.
It is an arithmetic number, because the mean of its divisors is an integer number (12846618706180).
Almost surely, 2132121220132004 is an apocalyptic number.
It is an amenable number.
132121220132004 is an abundant number, since it is smaller than the sum of its proper divisors (176197628816316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132121220132004 is a wasteful number, since it uses less digits than its factorization.
132121220132004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1285784779 (or 1285784777 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 132121220132004 its reverse (400231022121231), we get a palindrome (532352242253235).
The spelling of 132121220132004 in words is "one hundred thirty-two trillion, one hundred twenty-one billion, two hundred twenty million, one hundred thirty-two thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •