Base | Representation |
---|---|
bin | 11001001101000010… |
… | …01001000100100000 |
3 | 1021221000012022121202 |
4 | 30212201021010200 |
5 | 210202431432000 |
6 | 10114402540332 |
7 | 656212441052 |
oct | 144641110440 |
9 | 37830168552 |
10 | 13531124000 |
11 | 5813a6a809 |
12 | 27576676a8 |
13 | 1378433564 |
14 | 9251038d2 |
15 | 542db6dd5 |
hex | 326849120 |
13531124000 has 48 divisors (see below), whose sum is σ = 33245981496. Its totient is φ = 5412448000.
The previous prime is 13531123993. The next prime is 13531124003. The reversal of 13531124000 is 42113531.
It can be written as a sum of positive squares in 4 ways, for example, as 468462736 + 13062661264 = 21644^2 + 114292^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (13531124003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1687391 + ... + 1695390.
Almost surely, 213531124000 is an apocalyptic number.
13531124000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13531124000 is an abundant number, since it is smaller than the sum of its proper divisors (19714857496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13531124000 is an equidigital number, since it uses as much as digits as its factorization.
13531124000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3382806 (or 3382788 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 20.
Adding to 13531124000 its reverse (42113531), we get a palindrome (13573237531).
The spelling of 13531124000 in words is "thirteen billion, five hundred thirty-one million, one hundred twenty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •