Base | Representation |
---|---|
bin | 11000101000000100… |
… | …01100000101110101 |
3 | 1021010101200101221012 |
4 | 30110002030011311 |
5 | 204034040120041 |
6 | 10023524202005 |
7 | 645425546606 |
oct | 142402140565 |
9 | 37111611835 |
10 | 13221020021 |
11 | 5674a15030 |
12 | 268b839305 |
13 | 1329108791 |
14 | 8d5c5ddad |
15 | 525a5e3eb |
hex | 31408c175 |
13221020021 has 16 divisors (see below), whose sum is σ = 15195988800. Its totient is φ = 11376057600.
The previous prime is 13221019997. The next prime is 13221020041. The reversal of 13221020021 is 12002012231.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 13221020021 - 214 = 13221003637 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13221019978 and 13221020005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13221020041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 203261 + ... + 260301.
It is an arithmetic number, because the mean of its divisors is an integer number (949749300).
Almost surely, 213221020021 is an apocalyptic number.
13221020021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13221020021 is a deficient number, since it is larger than the sum of its proper divisors (1974968779).
13221020021 is a wasteful number, since it uses less digits than its factorization.
13221020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58180.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 13221020021 its reverse (12002012231), we get a palindrome (25223032252).
The spelling of 13221020021 in words is "thirteen billion, two hundred twenty-one million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •