Base | Representation |
---|---|
bin | 11000010000011111… |
… | …01011110011110101 |
3 | 1020121121111200201002 |
4 | 30020033223303311 |
5 | 203132421344341 |
6 | 5552141013045 |
7 | 640504432100 |
oct | 141017536365 |
9 | 36547450632 |
10 | 13023231221 |
11 | 5583302410 |
12 | 2635554185 |
13 | 12c7146aa0 |
14 | 8b7895737 |
15 | 5134e029b |
hex | 3083ebcf5 |
13023231221 has 24 divisors (see below), whose sum is σ = 17797991904. Its totient is φ = 9367354080.
The previous prime is 13023231203. The next prime is 13023231233. The reversal of 13023231221 is 12213232031.
It is not a de Polignac number, because 13023231221 - 218 = 13022969077 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13023231193 and 13023231202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13023231271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 922295 + ... + 936308.
It is an arithmetic number, because the mean of its divisors is an integer number (741582996).
Almost surely, 213023231221 is an apocalyptic number.
13023231221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13023231221 is a deficient number, since it is larger than the sum of its proper divisors (4774760683).
13023231221 is a wasteful number, since it uses less digits than its factorization.
13023231221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1858641 (or 1858634 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 13023231221 its reverse (12213232031), we get a palindrome (25236463252).
The spelling of 13023231221 in words is "thirteen billion, twenty-three million, two hundred thirty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •