Base | Representation |
---|---|
bin | 11110000110101011100111… |
… | …011010101100111110010001 |
3 | 122100210100221120211001201120 |
4 | 132012223213122230332101 |
5 | 114323222303331401340 |
6 | 1145331545335352453 |
7 | 36613423626362361 |
oct | 3606534732547621 |
9 | 570710846731646 |
10 | 132400544403345 |
11 | 39206834705729 |
12 | 12a24142522729 |
13 | 58b541918883a |
14 | 249a3132449a1 |
15 | 1049096b594d0 |
hex | 786ae76acf91 |
132400544403345 has 16 divisors (see below), whose sum is σ = 211851474701760. Its totient is φ = 70610089129664.
The previous prime is 132400544403317. The next prime is 132400544403353. The reversal of 132400544403345 is 543304445004231.
It is a cyclic number.
It is not a de Polignac number, because 132400544403345 - 28 = 132400544403089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 132400544403297 and 132400544403306.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 220599834 + ... + 221199203.
It is an arithmetic number, because the mean of its divisors is an integer number (13240717168860).
Almost surely, 2132400544403345 is an apocalyptic number.
132400544403345 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
132400544403345 is a deficient number, since it is larger than the sum of its proper divisors (79450930298415).
132400544403345 is a wasteful number, since it uses less digits than its factorization.
132400544403345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 441819024.
The product of its (nonzero) digits is 1382400, while the sum is 42.
Adding to 132400544403345 its reverse (543304445004231), we get a palindrome (675704989407576).
The spelling of 132400544403345 in words is "one hundred thirty-two trillion, four hundred billion, five hundred forty-four million, four hundred three thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •