Base | Representation |
---|---|
bin | 11000011100010001… |
… | …00000101101000101 |
3 | 1020212111101101020022 |
4 | 30032020200231011 |
5 | 203333213422041 |
6 | 10010030144525 |
7 | 643114164434 |
oct | 141610405505 |
9 | 36774341208 |
10 | 13122014021 |
11 | 5624042396 |
12 | 2662652145 |
13 | 131175254c |
14 | 8c6a4b11b |
15 | 51c00424b |
hex | 30e220b45 |
13122014021 has 8 divisors (see below), whose sum is σ = 13155510264. Its totient is φ = 13088560320.
The previous prime is 13122013987. The next prime is 13122014033. The reversal of 13122014021 is 12041022131.
It can be written as a sum of positive squares in 4 ways, for example, as 191822500 + 12930191521 = 13850^2 + 113711^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13122014021 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13122010021) 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 7 ways as a sum of consecutive naturals, for example, 659795 + ... + 679391.
It is an arithmetic number, because the mean of its divisors is an integer number (1644438783).
Almost surely, 213122014021 is an apocalyptic number.
It is an amenable number.
13122014021 is a deficient number, since it is larger than the sum of its proper divisors (33496243).
13122014021 is a wasteful number, since it uses less digits than its factorization.
13122014021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21271.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 13122014021 its reverse (12041022131), we get a palindrome (25163036152).
The spelling of 13122014021 in words is "thirteen billion, one hundred twenty-two million, fourteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •