Base | Representation |
---|---|
bin | 111101100100110110… |
… | …1010010101000100110 |
3 | 110122022112221002112110 |
4 | 1323021231102220212 |
5 | 4131303134041402 |
6 | 140425210301450 |
7 | 12360600623160 |
oct | 1731155225046 |
9 | 418275832473 |
10 | 132233112102 |
11 | 51097165323 |
12 | 21764727886 |
13 | c61472a840 |
14 | 6585cc5930 |
15 | 368de2156c |
hex | 1ec9b52a26 |
132233112102 has 64 divisors (see below), whose sum is σ = 325906366464. Its totient is φ = 34830794880.
The previous prime is 132233112031. The next prime is 132233112119. The reversal of 132233112102 is 201211332231.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 283227 + ... + 587097.
It is an arithmetic number, because the mean of its divisors is an integer number (5092286976).
Almost surely, 2132233112102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 132233112102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (162953183232).
132233112102 is an abundant number, since it is smaller than the sum of its proper divisors (193673254362).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132233112102 is a wasteful number, since it uses less digits than its factorization.
132233112102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 304693.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 132233112102 its reverse (201211332231), we get a palindrome (333444444333).
The spelling of 132233112102 in words is "one hundred thirty-two billion, two hundred thirty-three million, one hundred twelve thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •