Base | Representation |
---|---|
bin | 101110100101011101100… |
… | …110100101001010100111 |
3 | 102100001011120022020212002 |
4 | 232211131212211022213 |
5 | 404422301140432221 |
6 | 10450355551515515 |
7 | 450200501531315 |
oct | 56453546451247 |
9 | 12301146266762 |
10 | 3201321030311 |
11 | 1024744299568 |
12 | 43852bb28b9b |
13 | 1a2b6373b401 |
14 | b0d326110b5 |
15 | 58418b5e80b |
hex | 2e95d9a52a7 |
3201321030311 has 24 divisors (see below), whose sum is σ = 3426132304560. Its totient is φ = 2990497324032.
The previous prime is 3201321030307. The next prime is 3201321030319. The reversal of 3201321030311 is 1130301231023.
It is not a de Polignac number, because 3201321030311 - 22 = 3201321030307 is a prime.
It is a super-2 number, since 2×32013210303112 (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 (3201321030319) 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 23 ways as a sum of consecutive naturals, for example, 180479435 + ... + 180497171.
It is an arithmetic number, because the mean of its divisors is an integer number (142755512690).
Almost surely, 23201321030311 is an apocalyptic number.
3201321030311 is a deficient number, since it is larger than the sum of its proper divisors (224811274249).
3201321030311 is a wasteful number, since it uses less digits than its factorization.
3201321030311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22403 (or 22386 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 3201321030311 its reverse (1130301231023), we get a palindrome (4331622261334).
The spelling of 3201321030311 in words is "three trillion, two hundred one billion, three hundred twenty-one million, thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •