Base | Representation |
---|---|
bin | 10011000110000110011… |
… | …010110110001110110101 |
3 | 11122110001212211110001021 |
4 | 103012012122312032311 |
5 | 132444411333210401 |
6 | 2442454201101141 |
7 | 163543016515153 |
oct | 23060632661665 |
9 | 4573055743037 |
10 | 1312220210101 |
11 | 46656710a989 |
12 | 192397a877b1 |
13 | 96984a711a8 |
14 | 4772452a3d3 |
15 | 24201b932a1 |
hex | 131866b63b5 |
1312220210101 has 4 divisors (see below), whose sum is σ = 1312326277612. Its totient is φ = 1312114142592.
The previous prime is 1312220210087. The next prime is 1312220210111. The reversal of 1312220210101 is 1010120222131.
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 544239651076 + 767980559025 = 737726^2 + 876345^2 .
It is a cyclic number.
It is not a de Polignac number, because 1312220210101 - 27 = 1312220209973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1312220210111) 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, 53015196 + ... + 53039941.
It is an arithmetic number, because the mean of its divisors is an integer number (328081569403).
Almost surely, 21312220210101 is an apocalyptic number.
It is an amenable number.
1312220210101 is a deficient number, since it is larger than the sum of its proper divisors (106067511).
1312220210101 is a wasteful number, since it uses less digits than its factorization.
1312220210101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106067510.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 1312220210101 its reverse (1010120222131), we get a palindrome (2322340432232).
The spelling of 1312220210101 in words is "one trillion, three hundred twelve billion, two hundred twenty million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •