Base | Representation |
---|---|
bin | 101110111010000010111… |
… | …000100010011101101111 |
3 | 102102011012202220212102202 |
4 | 232322002320202131233 |
5 | 410303031330100221 |
6 | 10504452550012115 |
7 | 451612246144616 |
oct | 56720270423557 |
9 | 12364182825382 |
10 | 3223421331311 |
11 | 1033055341835 |
12 | 44087934703b |
13 | 1a4c762aabac |
14 | b202b82087d |
15 | 58cadea1d0b |
hex | 2ee82e2276f |
3223421331311 has 32 divisors (see below), whose sum is σ = 3370233484800. Its totient is φ = 3080492800000.
The previous prime is 3223421331283. The next prime is 3223421331331. The reversal of 3223421331311 is 1131331243223.
It is a cyclic number.
It is not a de Polignac number, because 3223421331311 - 222 = 3223417137007 is a prime.
It is a super-3 number, since 3×32234213313113 (a number of 39 digits) contains 333 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 (3223421331331) 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 31 ways as a sum of consecutive naturals, for example, 306141695 + ... + 306152223.
It is an arithmetic number, because the mean of its divisors is an integer number (105319796400).
Almost surely, 23223421331311 is an apocalyptic number.
3223421331311 is a deficient number, since it is larger than the sum of its proper divisors (146812153489).
3223421331311 is a wasteful number, since it uses less digits than its factorization.
3223421331311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11311.
The product of its digits is 7776, while the sum is 29.
Adding to 3223421331311 its reverse (1131331243223), we get a palindrome (4354752574534).
The spelling of 3223421331311 in words is "three trillion, two hundred twenty-three billion, four hundred twenty-one million, three hundred thirty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •