Base | Representation |
---|---|
bin | 11110000010010111100010… |
… | …100011111101111000101101 |
3 | 122022202000210120120101201121 |
4 | 132002113202203331320231 |
5 | 114303343204202434123 |
6 | 1144543442421540541 |
7 | 36553131000265456 |
oct | 3602274243757055 |
9 | 568660716511647 |
10 | 132104110202413 |
11 | 39102047298008 |
12 | 129967b3274751 |
13 | 5893497023c0b |
14 | 2489c3190c12d |
15 | 10414e755375d |
hex | 7825e28fde2d |
132104110202413 has 8 divisors (see below), whose sum is σ = 133350051287232. Its totient is φ = 130858378807296.
The previous prime is 132104110202401. The next prime is 132104110202423. The reversal of 132104110202413 is 314202011401231.
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 132104110202413 - 29 = 132104110201901 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132104110202423) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51156345 + ... + 53676622.
It is an arithmetic number, because the mean of its divisors is an integer number (16668756410904).
Almost surely, 2132104110202413 is an apocalyptic number.
It is an amenable number.
132104110202413 is a deficient number, since it is larger than the sum of its proper divisors (1245941084819).
132104110202413 is a wasteful number, since it uses less digits than its factorization.
132104110202413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104844851.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 132104110202413 its reverse (314202011401231), we get a palindrome (446306121603644).
The spelling of 132104110202413 in words is "one hundred thirty-two trillion, one hundred four billion, one hundred ten million, two hundred two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •