Base | Representation |
---|---|
bin | 1100000110001011011110… |
… | …1010000010111101100001 |
3 | 1202002111101202221012012020 |
4 | 3001202313222002331201 |
5 | 3220403003300013441 |
6 | 44142023511452053 |
7 | 2541625555446630 |
oct | 301426752027541 |
9 | 52074352835166 |
10 | 13300300001121 |
11 | 4268697681301 |
12 | 15a982b687029 |
13 | 75629c9b5483 |
14 | 33da48d3b517 |
15 | 180e88354e66 |
hex | c18b7a82f61 |
13300300001121 has 16 divisors (see below), whose sum is σ = 20268067200000. Its totient is φ = 7599817658448.
The previous prime is 13300300001099. The next prime is 13300300001137. The reversal of 13300300001121 is 12110000300331.
It is not a de Polignac number, because 13300300001121 - 217 = 13300299870049 is a prime.
It is a super-3 number, since 3×133003000011213 (a number of 40 digits) contains 333 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13300300001121.
It is not an unprimeable number, because it can be changed into a prime (13300300003121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14278221 + ... + 15181178.
It is an arithmetic number, because the mean of its divisors is an integer number (1266754200000).
Almost surely, 213300300001121 is an apocalyptic number.
It is an amenable number.
13300300001121 is a deficient number, since it is larger than the sum of its proper divisors (6967767198879).
13300300001121 is a wasteful number, since it uses less digits than its factorization.
13300300001121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29480908.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 13300300001121 its reverse (12110000300331), we get a palindrome (25410300301452).
The spelling of 13300300001121 in words is "thirteen trillion, three hundred billion, three hundred million, one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •