Base | Representation |
---|---|
bin | 10001110000010101101… |
… | …011000110111000111101 |
3 | 11022122101021000020212000 |
4 | 101300111223012320331 |
5 | 124442313342142023 |
6 | 2332304425132513 |
7 | 154103031501210 |
oct | 21602553067075 |
9 | 4278337006760 |
10 | 1220134334013 |
11 | 430502028261 |
12 | 17857862a139 |
13 | 8b09aa67a0a |
14 | 430aa5bb777 |
15 | 21b1263e243 |
hex | 11c15ac6e3d |
1220134334013 has 128 divisors (see below), whose sum is σ = 2230684876800. Its totient is φ = 643602055104.
The previous prime is 1220134333969. The next prime is 1220134334021. The reversal of 1220134334013 is 3104334310221.
It is a happy number.
1220134334013 is a `hidden beast` number, since 1 + 220 + 1 + 3 + 4 + 33 + 401 + 3 = 666.
It is not a de Polignac number, because 1220134334013 - 229 = 1219597463101 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1220134334063) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 38296456 + ... + 38328302.
It is an arithmetic number, because the mean of its divisors is an integer number (17427225600).
Almost surely, 21220134334013 is an apocalyptic number.
It is an amenable number.
1220134334013 is a deficient number, since it is larger than the sum of its proper divisors (1010550542787).
1220134334013 is a wasteful number, since it uses less digits than its factorization.
1220134334013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32156 (or 32150 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 1220134334013 its reverse (3104334310221), we get a palindrome (4324468644234).
The spelling of 1220134334013 in words is "one trillion, two hundred twenty billion, one hundred thirty-four million, three hundred thirty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •