Base | Representation |
---|---|
bin | 11000100110110001… |
… | …00100110000101101 |
3 | 1021002122011011121011 |
4 | 30103120210300231 |
5 | 204023242023041 |
6 | 10022454305221 |
7 | 645234043132 |
oct | 142330446055 |
9 | 37078134534 |
10 | 13210111021 |
11 | 5669843a28 |
12 | 2688058211 |
13 | 1326a89253 |
14 | 8d4620589 |
15 | 524b06e81 |
hex | 313624c2d |
13210111021 has 4 divisors (see below), whose sum is σ = 13212486972. Its totient is φ = 13207735072.
The previous prime is 13210110961. The next prime is 13210111027. The reversal of 13210111021 is 12011101231.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2796928996 + 10413182025 = 52886^2 + 102045^2 .
It is a cyclic number.
It is not a de Polignac number, because 13210111021 - 29 = 13210110509 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13210110992 and 13210111010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13210111027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1179616 + ... + 1190761.
It is an arithmetic number, because the mean of its divisors is an integer number (3303121743).
Almost surely, 213210111021 is an apocalyptic number.
It is an amenable number.
13210111021 is a deficient number, since it is larger than the sum of its proper divisors (2375951).
13210111021 is an equidigital number, since it uses as much as digits as its factorization.
13210111021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2375950.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 13210111021 its reverse (12011101231), we get a palindrome (25221212252).
The spelling of 13210111021 in words is "thirteen billion, two hundred ten million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •