Base | Representation |
---|---|
bin | 10001110000010011101… |
… | …001010100100010101101 |
3 | 11022122021212222201100022 |
4 | 101300103221110202231 |
5 | 124442231134424323 |
6 | 2332301212011525 |
7 | 154102136346320 |
oct | 21602351244255 |
9 | 4278255881308 |
10 | 1220100311213 |
11 | 4304948aa443 |
12 | 178569160ba5 |
13 | 8b0939b4994 |
14 | 430a5c827b7 |
15 | 21b0e66d4c8 |
hex | 11c13a548ad |
1220100311213 has 8 divisors (see below), whose sum is σ = 1400186251200. Its totient is φ = 1041460845120.
The previous prime is 1220100311173. The next prime is 1220100311251. The reversal of 1220100311213 is 3121130010221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1220100311213 - 210 = 1220100310189 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1220100311191 and 1220100311200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220100319213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 361616663 + ... + 361620036.
It is an arithmetic number, because the mean of its divisors is an integer number (175023281400).
Almost surely, 21220100311213 is an apocalyptic number.
It is an amenable number.
1220100311213 is a deficient number, since it is larger than the sum of its proper divisors (180085939987).
1220100311213 is an equidigital number, since it uses as much as digits as its factorization.
1220100311213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 723236947.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1220100311213 its reverse (3121130010221), we get a palindrome (4341230321434).
The spelling of 1220100311213 in words is "one trillion, two hundred twenty billion, one hundred million, three hundred eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •