Base | Representation |
---|---|
bin | 11110000010010111110100… |
… | …011101010000011011000110 |
3 | 122022202001120111111200222012 |
4 | 132002113310131100123012 |
5 | 114303344313032330342 |
6 | 1144543532304534222 |
7 | 36553141304226113 |
oct | 3602276435203306 |
9 | 568661514450865 |
10 | 132104410433222 |
11 | 39102190809947 |
12 | 12996877921372 |
13 | 58935142a2a96 |
14 | 2489c5d74190a |
15 | 1041513aaab82 |
hex | 7825f47506c6 |
132104410433222 has 8 divisors (see below), whose sum is σ = 198174008523096. Its totient is φ = 66046407592192.
The previous prime is 132104410433201. The next prime is 132104410433243. The reversal of 132104410433222 is 222334014401231.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (132104410433201) and next prime (132104410433243).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 2898783728 + ... + 2898829299.
It is an arithmetic number, because the mean of its divisors is an integer number (24771751065387).
Almost surely, 2132104410433222 is an apocalyptic number.
132104410433222 is a deficient number, since it is larger than the sum of its proper divisors (66069598089874).
132104410433222 is a wasteful number, since it uses less digits than its factorization.
132104410433222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5797624422.
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 132104410433222 its reverse (222334014401231), we get a palindrome (354438424834453).
The spelling of 132104410433222 in words is "one hundred thirty-two trillion, one hundred four billion, four hundred ten million, four hundred thirty-three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •