Base | Representation |
---|---|
bin | 1001000101100011101… |
… | …01000011111010100101 |
3 | 1002211220020010100202011 |
4 | 10202301311003322211 |
5 | 20103412101402323 |
6 | 355233222114221 |
7 | 31362062515300 |
oct | 4426165037245 |
9 | 1084806110664 |
10 | 312221122213 |
11 | 110459758300 |
12 | 5061627b971 |
13 | 23599a34880 |
14 | 1117c27db37 |
15 | 81c555c20d |
hex | 48b1d43ea5 |
312221122213 has 36 divisors (see below), whose sum is σ = 429924423180. Its totient is φ = 224574577920.
The previous prime is 312221122207. The next prime is 312221122303.
312221122213 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 2 ways, for example, as 107647641409 + 204573480804 = 328097^2 + 452298^2 .
It is not a de Polignac number, because 312221122213 - 25 = 312221122181 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312221122013) 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 35 ways as a sum of consecutive naturals, for example, 1948308 + ... + 2102461.
Almost surely, 2312221122213 is an apocalyptic number.
It is an amenable number.
312221122213 is a deficient number, since it is larger than the sum of its proper divisors (117703300967).
312221122213 is a wasteful number, since it uses less digits than its factorization.
312221122213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4050818 (or 4050800 counting only the distinct ones).
The product of its digits is 576, while the sum is 22.
Multiplying 312221122213 by its sum of digits (22), we get a palindrome (6868864688686).
It can be divided in two parts, 312221 and 122213, that added together give a palindrome (434434).
The spelling of 312221122213 in words is "three hundred twelve billion, two hundred twenty-one million, one hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •