Base | Representation |
---|---|
bin | 1100000011101011100110… |
… | …0111010010011100011100 |
3 | 1201221101121211022202022120 |
4 | 3000322321213102130130 |
5 | 3214202110042101310 |
6 | 44110205134542540 |
7 | 2535546212352630 |
oct | 300727147223434 |
9 | 51841554282276 |
10 | 13257383159580 |
11 | 42514741a101a |
12 | 15a1452967a50 |
13 | 752220546591 |
14 | 33b937212dc0 |
15 | 17ecc5753b70 |
hex | c0eb99d271c |
13257383159580 has 192 divisors, whose sum is σ = 44697922633728. Its totient is φ = 2870367540480.
The previous prime is 13257383159563. The next prime is 13257383159609. The reversal of 13257383159580 is 8595138375231.
13257383159580 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (60).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 5667156 + ... + 7657115.
It is an arithmetic number, because the mean of its divisors is an integer number (232801680384).
Almost surely, 213257383159580 is an apocalyptic number.
13257383159580 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13257383159580 is an abundant number, since it is smaller than the sum of its proper divisors (31440539474148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13257383159580 is a wasteful number, since it uses less digits than its factorization.
13257383159580 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13324416 (or 13324414 counting only the distinct ones).
The product of its (nonzero) digits is 27216000, while the sum is 60.
The spelling of 13257383159580 in words is "thirteen trillion, two hundred fifty-seven billion, three hundred eighty-three million, one hundred fifty-nine thousand, five hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •