Base | Representation |
---|---|
bin | 1100000111111011001111… |
… | …0011000000010111110101 |
3 | 1202012100211112020122112001 |
4 | 3001332303303000113311 |
5 | 3221400423300341041 |
6 | 44203504424055301 |
7 | 2544040155362356 |
oct | 301766363002765 |
9 | 52170745218461 |
10 | 13330300012021 |
11 | 427a391922543 |
12 | 15b3602604531 |
13 | 759071082505 |
14 | 341293389d2d |
15 | 181b41e82131 |
hex | c1fb3cc05f5 |
13330300012021 has 6 divisors (see below), whose sum is σ = 13456046586710. Its totient is φ = 13205717757576.
The previous prime is 13330300011997. The next prime is 13330300012033. The reversal of 13330300012021 is 12021000303331.
It can be written as a sum of positive squares in only one way, i.e., 11872255836996 + 1458044175025 = 3445614^2 + 1207495^2 .
It is not a de Polignac number, because 13330300012021 - 215 = 13330299979253 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13330300012021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13330300012921) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 582148566 + ... + 582171463.
Almost surely, 213330300012021 is an apocalyptic number.
It is an amenable number.
13330300012021 is a deficient number, since it is larger than the sum of its proper divisors (125746574689).
13330300012021 is an equidigital number, since it uses as much as digits as its factorization.
13330300012021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1164320243 (or 1164320136 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 13330300012021 its reverse (12021000303331), we get a palindrome (25351300315352).
The spelling of 13330300012021 in words is "thirteen trillion, three hundred thirty billion, three hundred million, twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •