Base | Representation |
---|---|
bin | 10001100111001100110… |
… | …000111110101101011101 |
3 | 11021201001100212111102200 |
4 | 101213030300332231131 |
5 | 124312214211431023 |
6 | 2324002555442113 |
7 | 153304613321010 |
oct | 21471460765535 |
9 | 4251040774380 |
10 | 1210321202013 |
11 | 427326846a10 |
12 | 17669a156339 |
13 | 8a1959b7531 |
14 | 428191bd377 |
15 | 2173ad94743 |
hex | 119ccc3eb5d |
1210321202013 has 48 divisors (see below), whose sum is σ = 2186590114176. Its totient is φ = 626729425920.
The previous prime is 1210321201993. The next prime is 1210321202029. The reversal of 1210321202013 is 3102021230121.
1210321202013 is a `hidden beast` number, since 121 + 0 + 321 + 20 + 201 + 3 = 666.
It is not a de Polignac number, because 1210321202013 - 213 = 1210321193821 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1210321202053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2573020 + ... + 3006837.
It is an arithmetic number, because the mean of its divisors is an integer number (45553960712).
Almost surely, 21210321202013 is an apocalyptic number.
It is an amenable number.
1210321202013 is a deficient number, since it is larger than the sum of its proper divisors (976268912163).
1210321202013 is a wasteful number, since it uses less digits than its factorization.
1210321202013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5580194 (or 5580191 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 1210321202013 its reverse (3102021230121), we get a palindrome (4312342432134).
The spelling of 1210321202013 in words is "one trillion, two hundred ten billion, three hundred twenty-one million, two hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •