Base | Representation |
---|---|
bin | 11000101011100011… |
… | …11011101111110000 |
3 | 1021012102210122121202 |
4 | 30111301323233300 |
5 | 204114040010300 |
6 | 10030452110332 |
7 | 646232542505 |
oct | 142561735760 |
9 | 37172718552 |
10 | 13250313200 |
11 | 568a502473 |
12 | 26996053a8 |
13 | 13321c3b17 |
14 | 8d9ac74ac |
15 | 5283e8ad5 |
hex | 315c7bbf0 |
13250313200 has 60 divisors (see below), whose sum is σ = 31856688720. Its totient is φ = 5296327680.
The previous prime is 13250313191. The next prime is 13250313203. The reversal of 13250313200 is 231305231.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13250313203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 584477 + ... + 606723.
It is an arithmetic number, because the mean of its divisors is an integer number (530944812).
Almost surely, 213250313200 is an apocalyptic number.
13250313200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13250313200 is an abundant number, since it is smaller than the sum of its proper divisors (18606375520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13250313200 is a wasteful number, since it uses less digits than its factorization.
13250313200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23754 (or 23743 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 20.
Adding to 13250313200 its reverse (231305231), we get a palindrome (13481618431).
It can be divided in two parts, 1325031 and 3200, that added together give a palindrome (1328231).
The spelling of 13250313200 in words is "thirteen billion, two hundred fifty million, three hundred thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •