Base | Representation |
---|---|
bin | 1011111100010011000011… |
… | …1001010000100101110000 |
3 | 1201111021012120202212212112 |
4 | 2333010300321100211300 |
5 | 3210112314021343100 |
6 | 43532030141544452 |
7 | 2523435622603052 |
oct | 277046071204560 |
9 | 51437176685775 |
10 | 13130535340400 |
11 | 42026a0984005 |
12 | 1580951875128 |
13 | 7432867399ca |
14 | 3357426458d2 |
15 | 17b84e4e4b35 |
hex | bf130e50970 |
13130535340400 has 120 divisors (see below), whose sum is σ = 31982437015344. Its totient is φ = 5179973632000.
The previous prime is 13130535340399. The next prime is 13130535340421. The reversal of 13130535340400 is 404353503131.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9750479 + ... + 11015121.
Almost surely, 213130535340400 is an apocalyptic number.
13130535340400 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 13130535340400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15991218507672).
13130535340400 is an abundant number, since it is smaller than the sum of its proper divisors (18851901674944).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13130535340400 is a wasteful number, since it uses less digits than its factorization.
13130535340400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1265019 (or 1265008 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 32.
Adding to 13130535340400 its reverse (404353503131), we get a palindrome (13534888843531).
The spelling of 13130535340400 in words is "thirteen trillion, one hundred thirty billion, five hundred thirty-five million, three hundred forty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •