Base | Representation |
---|---|
bin | 1011111100000010111100… |
… | …1011001011011100101000 |
3 | 1201110212001020201212010111 |
4 | 2333000233023023130220 |
5 | 3210024440122004300 |
6 | 43530033123224104 |
7 | 2523223520652436 |
oct | 277005713133450 |
9 | 51425036655114 |
10 | 13126211516200 |
11 | 4200882223982 |
12 | 157bb45818034 |
13 | 742a479c8553 |
14 | 3354522b9d56 |
15 | 17b699b069ba |
hex | bf02f2cb728 |
13126211516200 has 24 divisors (see below), whose sum is σ = 30518441775630. Its totient is φ = 5250484606400.
The previous prime is 13126211516149. The next prime is 13126211516329. The reversal of 13126211516200 is 261511262131.
It can be written as a sum of positive squares in 3 ways, for example, as 5659250850724 + 7466960665476 = 2378918^2 + 2732574^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 32815528591 + ... + 32815528990.
Almost surely, 213126211516200 is an apocalyptic number.
13126211516200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13126211516200 is an abundant number, since it is smaller than the sum of its proper divisors (17392230259430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13126211516200 is a wasteful number, since it uses less digits than its factorization.
13126211516200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65631057597 (or 65631057588 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 31.
Adding to 13126211516200 its reverse (261511262131), we get a palindrome (13387722778331).
The spelling of 13126211516200 in words is "thirteen trillion, one hundred twenty-six billion, two hundred eleven million, five hundred sixteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •