Base | Representation |
---|---|
bin | 1100000110110111001000… |
… | …1111011100000011100000 |
3 | 1202010121122120202001201220 |
4 | 3001231302033130003200 |
5 | 3221101004144100000 |
6 | 44151242510255040 |
7 | 2542522162366332 |
oct | 301556217340340 |
9 | 52117576661656 |
10 | 13312020300000 |
11 | 4272661463324 |
12 | 15abb607b7480 |
13 | 757419c08676 |
14 | 34043b74b452 |
15 | 1814222761a0 |
hex | c1b723dc0e0 |
13312020300000 has 144 divisors (see below), whose sum is σ = 43677272069424. Its totient is φ = 3549872000000.
The previous prime is 13312020299959. The next prime is 13312020300037. The reversal of 13312020300000 is 302021331.
It is a super-2 number, since 2×133120203000002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
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, 21886701 + ... + 22486700.
It is an arithmetic number, because the mean of its divisors is an integer number (303314389371).
Almost surely, 213312020300000 is an apocalyptic number.
13312020300000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13312020300000 is an abundant number, since it is smaller than the sum of its proper divisors (30365251769424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13312020300000 is an frugal number, since it uses more digits than its factorization.
13312020300000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44373439 (or 44373411 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 13312020300000 its reverse (302021331), we get a palindrome (13312322321331).
The spelling of 13312020300000 in words is "thirteen trillion, three hundred twelve billion, twenty million, three hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •