Base | Representation |
---|---|
bin | 101110101110101010100… |
… | …000011111001100010001 |
3 | 102100222200010121112210201 |
4 | 232232222200133030101 |
5 | 410103020002310301 |
6 | 10455112214255201 |
7 | 451000362643252 |
oct | 56565240371421 |
9 | 12328603545721 |
10 | 3211201213201 |
11 | 1028954407173 |
12 | 43a428957501 |
13 | 1a3a79666c87 |
14 | b15cc8a4b29 |
15 | 587e6251201 |
hex | 2ebaa81f311 |
3211201213201 has 8 divisors (see below), whose sum is σ = 3243294454400. Its totient is φ = 3179155839120.
The previous prime is 3211201213159. The next prime is 3211201213237. The reversal of 3211201213201 is 1023121021123.
3211201213201 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
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 3211201213201 - 233 = 3202611278609 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3211201214201) 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, 11831931 + ... + 12100288.
It is an arithmetic number, because the mean of its divisors is an integer number (405411806800).
Almost surely, 23211201213201 is an apocalyptic number.
It is an amenable number.
3211201213201 is a deficient number, since it is larger than the sum of its proper divisors (32093241199).
3211201213201 is a wasteful number, since it uses less digits than its factorization.
3211201213201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23933559.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 3211201213201 its reverse (1023121021123), we get a palindrome (4234322234324).
The spelling of 3211201213201 in words is "three trillion, two hundred eleven billion, two hundred one million, two hundred thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •