Base | Representation |
---|---|
bin | 1100000011010001101011… |
… | …0000111100010010111100 |
3 | 1201220201122202211102010020 |
4 | 3000310122300330102330 |
5 | 3214043331311130120 |
6 | 44103054345412140 |
7 | 2535211560253101 |
oct | 300643260742274 |
9 | 51821582742106 |
10 | 13250423145660 |
11 | 42495224785a8 |
12 | 15a002ba9a050 |
13 | 751681600a4c |
14 | 33b476b04aa8 |
15 | 17ea196d7640 |
hex | c0d1ac3c4bc |
13250423145660 has 192 divisors, whose sum is σ = 38100994928640. Its totient is φ = 3439870156800.
The previous prime is 13250423145647. The next prime is 13250423145677. The reversal of 13250423145660 is 6654132405231.
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, 91043709 + ... + 91189131.
It is an arithmetic number, because the mean of its divisors is an integer number (198442681920).
Almost surely, 213250423145660 is an apocalyptic number.
13250423145660 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13250423145660, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19050497464320).
13250423145660 is an abundant number, since it is smaller than the sum of its proper divisors (24850571782980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13250423145660 is a wasteful number, since it uses less digits than its factorization.
13250423145660 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145788 (or 145786 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 42.
The spelling of 13250423145660 in words is "thirteen trillion, two hundred fifty billion, four hundred twenty-three million, one hundred forty-five thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •