Base | Representation |
---|---|
bin | 1011110100111001111011… |
… | …0011111100111011000000 |
3 | 1201001010101101121122112221 |
4 | 2331032132303330323000 |
5 | 3201022212242032000 |
6 | 43353423413500424 |
7 | 2511321414613624 |
oct | 275163663747300 |
9 | 51033341548487 |
10 | 13003530424000 |
11 | 4163847a17586 |
12 | 1560208041714 |
13 | 7342c62179bc |
14 | 32d534c63184 |
15 | 1783b95a361a |
hex | bd39ecfcec0 |
13003530424000 has 112 divisors (see below), whose sum is σ = 33603384574656. Its totient is φ = 4975263744000.
The previous prime is 13003530423907. The next prime is 13003530424007. The reversal of 13003530424000 is 42403530031.
It is a super-3 number, since 3×130035304240003 (a number of 40 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (13003530424007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35151681 + ... + 35519680.
Almost surely, 213003530424000 is an apocalyptic number.
13003530424000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13003530424000 is an abundant number, since it is smaller than the sum of its proper divisors (20599854150656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13003530424000 is an equidigital number, since it uses as much as digits as its factorization.
13003530424000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70671411 (or 70671391 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 25.
Adding to 13003530424000 its reverse (42403530031), we get a palindrome (13045933954031).
The spelling of 13003530424000 in words is "thirteen trillion, three billion, five hundred thirty million, four hundred twenty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •