Base | Representation |
---|---|
bin | 11110001010010111101011… |
… | …100001011010110010101100 |
3 | 122101200121012110222201222021 |
4 | 132022113223201122302230 |
5 | 114341400411140440322 |
6 | 1150044225214555524 |
7 | 36640636121332660 |
oct | 3612275341326254 |
9 | 571617173881867 |
10 | 132654016343212 |
11 | 392a4285a40771 |
12 | 12a652a1808ba4 |
13 | 59032b263b000 |
14 | 24a86babcc8a0 |
15 | 105097e68b4c7 |
hex | 78a5eb85acac |
132654016343212 has 384 divisors, whose sum is σ = 302289787699200. Its totient is φ = 49828303429632.
The previous prime is 132654016343197. The next prime is 132654016343237. The reversal of 132654016343212 is 212343610456231.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 28206252453 + ... + 28206257155.
It is an arithmetic number, because the mean of its divisors is an integer number (787212988800).
Almost surely, 2132654016343212 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 132654016343212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (151144893849600).
132654016343212 is an abundant number, since it is smaller than the sum of its proper divisors (169635771355988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132654016343212 is a wasteful number, since it uses less digits than its factorization.
132654016343212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5042 (or 5014 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 43.
Adding to 132654016343212 its reverse (212343610456231), we get a palindrome (344997626799443).
The spelling of 132654016343212 in words is "one hundred thirty-two trillion, six hundred fifty-four billion, sixteen million, three hundred forty-three thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •