Base | Representation |
---|---|
bin | 11110000100001101110101… |
… | …000011100010000100100100 |
3 | 122100012011122020200100021220 |
4 | 132010031311003202010210 |
5 | 114312433314213032322 |
6 | 1145122045553340340 |
7 | 36565245320624052 |
oct | 3604156503420444 |
9 | 570164566610256 |
10 | 132231122002212 |
11 | 391509a41260a2 |
12 | 129b733b2676b0 |
13 | 58a2458ab603c |
14 | 24920401a31d2 |
15 | 104497cda455c |
hex | 7843750e2124 |
132231122002212 has 48 divisors (see below), whose sum is σ = 309470254575552. Its totient is φ = 43944090910720.
The previous prime is 132231122002169. The next prime is 132231122002237. The reversal of 132231122002212 is 212200221132231.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20179483 + ... + 25916669.
It is an arithmetic number, because the mean of its divisors is an integer number (6447296970324).
Almost surely, 2132231122002212 is an apocalyptic number.
132231122002212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
132231122002212 is an abundant number, since it is smaller than the sum of its proper divisors (177239132573340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132231122002212 is a wasteful number, since it uses less digits than its factorization.
132231122002212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5742988 (or 5742986 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 132231122002212 its reverse (212200221132231), we get a palindrome (344431343134443).
The spelling of 132231122002212 in words is "one hundred thirty-two trillion, two hundred thirty-one billion, one hundred twenty-two million, two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •