Base | Representation |
---|---|
bin | 101110101110101010011… |
… | …101000101011010111101 |
3 | 102100222200001221020020010 |
4 | 232232222131011122331 |
5 | 410103014240234323 |
6 | 10455112143213433 |
7 | 451000352236563 |
oct | 56565235053275 |
9 | 12328601836203 |
10 | 3211200321213 |
11 | 1028953957a95 |
12 | 43a4285a7279 |
13 | 1a3a79413c81 |
14 | b15cc711a33 |
15 | 587e6126c93 |
hex | 2ebaa7456bd |
3211200321213 has 16 divisors (see below), whose sum is σ = 4284414605952. Its totient is φ = 2139393336000.
The previous prime is 3211200321157. The next prime is 3211200321253. The reversal of 3211200321213 is 3121230021123.
It is not a de Polignac number, because 3211200321213 - 226 = 3211133212349 is a prime.
It is a super-3 number, since 3×32112003212133 (a number of 38 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3211200321213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3211200321253) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 102673768 + ... + 102705038.
It is an arithmetic number, because the mean of its divisors is an integer number (267775912872).
Almost surely, 23211200321213 is an apocalyptic number.
It is an amenable number.
3211200321213 is a deficient number, since it is larger than the sum of its proper divisors (1073214284739).
3211200321213 is a wasteful number, since it uses less digits than its factorization.
3211200321213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52676.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 3211200321213 its reverse (3121230021123), we get a palindrome (6332430342336).
The spelling of 3211200321213 in words is "three trillion, two hundred eleven billion, two hundred million, three hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •