Base | Representation |
---|---|
bin | 1011111100010001110011… |
… | …1010111101010010010100 |
3 | 1201111020100020020002022202 |
4 | 2333010130322331102110 |
5 | 3210111122230210200 |
6 | 43531533011344032 |
7 | 2523424413366542 |
oct | 277043472752224 |
9 | 51436306202282 |
10 | 13130200241300 |
11 | 42025398070aa |
12 | 15808795b2018 |
13 | 7432321a000c |
14 | 33570dd36d92 |
15 | 17b82eda11d5 |
hex | bf11cebd494 |
13130200241300 has 18 divisors (see below), whose sum is σ = 28492534523838. Its totient is φ = 5252080096480.
The previous prime is 13130200241273. The next prime is 13130200241339. The reversal of 13130200241300 is 314200203131.
It can be written as a sum of positive squares in 3 ways, for example, as 261421554436 + 12868778686864 = 511294^2 + 3587308^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 65651001107 + ... + 65651001306.
Almost surely, 213130200241300 is an apocalyptic number.
13130200241300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13130200241300 is an abundant number, since it is smaller than the sum of its proper divisors (15362334282538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13130200241300 is a wasteful number, since it uses less digits than its factorization.
13130200241300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131302002427 (or 131302002420 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 13130200241300 its reverse (314200203131), we get a palindrome (13444400444431).
The spelling of 13130200241300 in words is "thirteen trillion, one hundred thirty billion, two hundred million, two hundred forty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •