Base | Representation |
---|---|
bin | 1011111100111111001000… |
… | …0010110101001001101100 |
3 | 1201112101202001211211022111 |
4 | 2333033302002311021230 |
5 | 3210311031120133412 |
6 | 43541304113253404 |
7 | 2524335035000200 |
oct | 277176202651154 |
9 | 51471661754274 |
10 | 13142365786732 |
11 | 4207711958486 |
12 | 15830b3864264 |
13 | 744420717400 |
14 | 336145928b00 |
15 | 17bce2e222a7 |
hex | bf3f20b526c |
13142365786732 has 216 divisors, whose sum is σ = 30978402708960. Its totient is φ = 4844873779200.
The previous prime is 13142365786709. The next prime is 13142365786747. The reversal of 13142365786732 is 23768756324131.
It is a Smith number, since the sum of its digits (58) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 56758369 + ... + 56989447.
It is an arithmetic number, because the mean of its divisors is an integer number (143418531060).
Almost surely, 213142365786732 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13142365786732, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15489201354480).
13142365786732 is an abundant number, since it is smaller than the sum of its proper divisors (17836036922228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13142365786732 is a wasteful number, since it uses less digits than its factorization.
13142365786732 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 231241 (or 231219 counting only the distinct ones).
The product of its digits is 30481920, while the sum is 58.
The spelling of 13142365786732 in words is "thirteen trillion, one hundred forty-two billion, three hundred sixty-five million, seven hundred eighty-six thousand, seven hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •