Base | Representation |
---|---|
bin | 10110110000110000… |
… | …11001110010001001 |
3 | 1011112122111000002222 |
4 | 23120120121302021 |
5 | 200011333212223 |
6 | 5340333303425 |
7 | 611554034213 |
oct | 133030316211 |
9 | 34478430088 |
10 | 12220210313 |
11 | 5200a98973 |
12 | 2450634b75 |
13 | 11c9976b9c |
14 | 83cd815b3 |
15 | 4b7c6d0c8 |
hex | 2d8619c89 |
12220210313 has 4 divisors (see below), whose sum is σ = 12234371328. Its totient is φ = 12206049300.
The previous prime is 12220210271. The next prime is 12220210361. The reversal of 12220210313 is 31301202221.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31301202221 = 12821 ⋅2441401.
It is a cyclic number.
It is not a de Polignac number, because 12220210313 - 210 = 12220209289 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12220210291 and 12220210300.
It is not an unprimeable number, because it can be changed into a prime (12220210363) 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, 7079213 + ... + 7080938.
It is an arithmetic number, because the mean of its divisors is an integer number (3058592832).
Almost surely, 212220210313 is an apocalyptic number.
It is an amenable number.
12220210313 is a deficient number, since it is larger than the sum of its proper divisors (14161015).
12220210313 is an equidigital number, since it uses as much as digits as its factorization.
12220210313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14161014.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 12220210313 its reverse (31301202221), we get a palindrome (43521412534).
The spelling of 12220210313 in words is "twelve billion, two hundred twenty million, two hundred ten thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •