Base | Representation |
---|---|
bin | 11000101011101000… |
… | …10101101001000000 |
3 | 1021012110222200022010 |
4 | 30111310111221000 |
5 | 204114220143202 |
6 | 10030513412520 |
7 | 646241106330 |
oct | 142564255100 |
9 | 37173880263 |
10 | 13250943552 |
11 | 568a8a3020 |
12 | 269986a140 |
13 | 1332384a02 |
14 | 8d9c0d0c0 |
15 | 5284c076c |
hex | 315d15a40 |
13250943552 has 448 divisors, whose sum is σ = 46723645440. Its totient is φ = 3212697600.
The previous prime is 13250943551. The next prime is 13250943557. The reversal of 13250943552 is 25534905231.
It is a tau number, because it is divible by the number of its divisors (448).
It is a self number, because there is not a number n which added to its sum of digits gives 13250943552.
It is not an unprimeable number, because it can be changed into a prime (13250943551) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 13290318 + ... + 13291314.
Almost surely, 213250943552 is an apocalyptic number.
13250943552 is a gapful number since it is divisible by the number (12) 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 13250943552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23361822720).
13250943552 is an abundant number, since it is smaller than the sum of its proper divisors (33472701888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13250943552 is a wasteful number, since it uses less digits than its factorization.
13250943552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1090 (or 1080 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 39.
The spelling of 13250943552 in words is "thirteen billion, two hundred fifty million, nine hundred forty-three thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •