Base | Representation |
---|---|
bin | 11110000011111101001110… |
… | …111110100111111011100011 |
3 | 122100010110122102200002200020 |
4 | 132003331032332213323203 |
5 | 114312140321121441344 |
6 | 1145105541505124523 |
7 | 36564044623354152 |
oct | 3603751676477343 |
9 | 570113572602606 |
10 | 132213303312099 |
11 | 3914438aa20519 |
12 | 129b39a7929743 |
13 | 58a08792c7919 |
14 | 249122d891599 |
15 | 10442888b2719 |
hex | 783f4efa7ee3 |
132213303312099 has 8 divisors (see below), whose sum is σ = 176920810209360. Its totient is φ = 87823999311456.
The previous prime is 132213303312071. The next prime is 132213303312169. The reversal of 132213303312099 is 990213303312231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132213303312099 - 29 = 132213303311587 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 132213303312099.
It is not an unprimeable number, because it can be changed into a prime (132213303312049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 79550723184 + ... + 79550724845.
It is an arithmetic number, because the mean of its divisors is an integer number (22115101276170).
Almost surely, 2132213303312099 is an apocalyptic number.
132213303312099 is a deficient number, since it is larger than the sum of its proper divisors (44707506897261).
132213303312099 is a wasteful number, since it uses less digits than its factorization.
132213303312099 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 159101448309.
The product of its (nonzero) digits is 157464, while the sum is 42.
The spelling of 132213303312099 in words is "one hundred thirty-two trillion, two hundred thirteen billion, three hundred three million, three hundred twelve thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •