Base | Representation |
---|---|
bin | 111101100001001111… |
… | …1101011011100101101 |
3 | 110122000010020012112202 |
4 | 1323002133223130231 |
5 | 4131031144300323 |
6 | 140405204511245 |
7 | 12354601230446 |
oct | 1730237533455 |
9 | 418003205482 |
10 | 132112103213 |
11 | 51034924582 |
12 | 217300ab525 |
13 | c5c563c64c |
14 | 6573bc62cd |
15 | 36834bbd28 |
hex | 1ec27eb72d |
132112103213 has 8 divisors (see below), whose sum is σ = 139893065280. Its totient is φ = 124332214720.
The previous prime is 132112103197. The next prime is 132112103257. The reversal of 132112103213 is 312301211231.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132112103213 - 24 = 132112103197 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132112903213) 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, 7793 + ... + 514086.
It is an arithmetic number, because the mean of its divisors is an integer number (17486633160).
Almost surely, 2132112103213 is an apocalyptic number.
It is an amenable number.
132112103213 is a deficient number, since it is larger than the sum of its proper divisors (7780962067).
132112103213 is a wasteful number, since it uses less digits than its factorization.
132112103213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 536787.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 132112103213 its reverse (312301211231), we get a palindrome (444413314444).
The spelling of 132112103213 in words is "one hundred thirty-two billion, one hundred twelve million, one hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •