Base | Representation |
---|---|
bin | 11110000010101111110111… |
… | …101011100111110011001101 |
3 | 122022211112020012201210202001 |
4 | 132002233313223213303031 |
5 | 114304310204442200123 |
6 | 1145003443000432301 |
7 | 36555044244611560 |
oct | 3602576753476315 |
9 | 568745205653661 |
10 | 132130234334413 |
11 | 39112132721047 |
12 | 1299b884178691 |
13 | 5895a9b40a1a3 |
14 | 248b1cd2b64d7 |
15 | 1042025c770ad |
hex | 782bf7ae7ccd |
132130234334413 has 8 divisors (see below), whose sum is σ = 151018306195328. Its totient is φ = 113245243498224.
The previous prime is 132130234334407. The next prime is 132130234334431. The reversal of 132130234334413 is 314433432031231.
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 132130234334413 - 213 = 132130234326221 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 (132130234334513) 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, 770164281 + ... + 770335822.
It is an arithmetic number, because the mean of its divisors is an integer number (18877288274416).
Almost surely, 2132130234334413 is an apocalyptic number.
It is an amenable number.
132130234334413 is a deficient number, since it is larger than the sum of its proper divisors (18888071860915).
132130234334413 is a wasteful number, since it uses less digits than its factorization.
132130234334413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1540512363.
The product of its (nonzero) digits is 186624, while the sum is 37.
Adding to 132130234334413 its reverse (314433432031231), we get a palindrome (446563666365644).
The spelling of 132130234334413 in words is "one hundred thirty-two trillion, one hundred thirty billion, two hundred thirty-four million, three hundred thirty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •