Base | Representation |
---|---|
bin | 1100000110001110111010… |
… | …0000000001101000100001 |
3 | 1202002120202220022010112202 |
4 | 3001203232200001220201 |
5 | 3220411344322333441 |
6 | 44142255101102545 |
7 | 2541660430364342 |
oct | 301435640015041 |
9 | 52076686263482 |
10 | 13301220121121 |
11 | 4269019aa6059 |
12 | 15a9a47857a55 |
13 | 7563b8504a8a |
14 | 33dad52140c9 |
15 | 180ede00819b |
hex | c18ee801a21 |
13301220121121 has 8 divisors (see below), whose sum is σ = 13400940607488. Its totient is φ = 13201652700000.
The previous prime is 13301220121067. The next prime is 13301220121139. The reversal of 13301220121121 is 12112102210331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13301220121121 - 230 = 13300146379297 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13301220121093 and 13301220121102.
It is not an unprimeable number, because it can be changed into a prime (13301220121181) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38091860 + ... + 38439461.
It is an arithmetic number, because the mean of its divisors is an integer number (1675117575936).
Almost surely, 213301220121121 is an apocalyptic number.
It is an amenable number.
13301220121121 is a deficient number, since it is larger than the sum of its proper divisors (99720486367).
13301220121121 is a wasteful number, since it uses less digits than its factorization.
13301220121121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76532623.
The product of its (nonzero) digits is 144, while the sum is 20.
Adding to 13301220121121 its reverse (12112102210331), we get a palindrome (25413322331452).
The spelling of 13301220121121 in words is "thirteen trillion, three hundred one billion, two hundred twenty million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •