Base | Representation |
---|---|
bin | 1011110101110111010110… |
… | …1111010110001100100101 |
3 | 1201002200221122221220002002 |
4 | 2331131311233112030211 |
5 | 3201310000413021013 |
6 | 43405152024455045 |
7 | 2512444156225514 |
oct | 275356557261445 |
9 | 51080848856062 |
10 | 13020021220133 |
11 | 416a83a602814 |
12 | 156344a91a485 |
13 | 735a23882935 |
14 | 33025b07267b |
15 | 178a321e5358 |
hex | bd775bd6325 |
13020021220133 has 8 divisors (see below), whose sum is σ = 13501738094208. Its totient is φ = 12545137209744.
The previous prime is 13020021220121. The next prime is 13020021220201. The reversal of 13020021220133 is 33102212002031.
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 13020021220133 - 236 = 12951301743397 is a prime.
It is a super-2 number, since 2×130200212201332 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13020021220103) 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, 1708212041 + ... + 1708219662.
It is an arithmetic number, because the mean of its divisors is an integer number (1687717261776).
Almost surely, 213020021220133 is an apocalyptic number.
It is an amenable number.
13020021220133 is a deficient number, since it is larger than the sum of its proper divisors (481716874075).
13020021220133 is a wasteful number, since it uses less digits than its factorization.
13020021220133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3416431843.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 13020021220133 its reverse (33102212002031), we get a palindrome (46122233222164).
The spelling of 13020021220133 in words is "thirteen trillion, twenty billion, twenty-one million, two hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •