Base | Representation |
---|---|
bin | 101110110000100011000… |
… | …010001001000010111111 |
3 | 102101011220001112021012221 |
4 | 232300203002021002333 |
5 | 410121140131120221 |
6 | 10500045010510211 |
7 | 451101445262002 |
oct | 56604302110277 |
9 | 12334801467187 |
10 | 3213223301311 |
11 | 10297a186a971 |
12 | 43a8b1b95367 |
13 | 1a400c57600a |
14 | b174126d539 |
15 | 588b3a28541 |
hex | 2ec230890bf |
3213223301311 has 16 divisors (see below), whose sum is σ = 3262532929920. Its totient is φ = 3164232867840.
The previous prime is 3213223301291. The next prime is 3213223301363. The reversal of 3213223301311 is 1131033223123.
It is a cyclic number.
It is not a de Polignac number, because 3213223301311 - 221 = 3213221204159 is a prime.
It is a super-2 number, since 2×32132233013112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3213223301411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 22060555 + ... + 22205731.
It is an arithmetic number, because the mean of its divisors is an integer number (203908308120).
Almost surely, 23213223301311 is an apocalyptic number.
3213223301311 is a deficient number, since it is larger than the sum of its proper divisors (49309628609).
3213223301311 is a wasteful number, since it uses less digits than its factorization.
3213223301311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146274.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 3213223301311 its reverse (1131033223123), we get a palindrome (4344256524434).
The spelling of 3213223301311 in words is "three trillion, two hundred thirteen billion, two hundred twenty-three million, three hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •