Base | Representation |
---|---|
bin | 101110100101011101001… |
… | …001010000101000011111 |
3 | 102100001011000211202021001 |
4 | 232211131021100220133 |
5 | 404422242204002111 |
6 | 10450355115051131 |
7 | 450200346306325 |
oct | 56453511205037 |
9 | 12301130752231 |
10 | 3201313344031 |
11 | 102473aa19770 |
12 | 438529440aa7 |
13 | 1a2b61c79a0a |
14 | b0d315add15 |
15 | 584181421c1 |
hex | 2e95d250a1f |
3201313344031 has 16 divisors (see below), whose sum is σ = 3721718596608. Its totient is φ = 2724521984800.
The previous prime is 3201313344007. The next prime is 3201313344041. The reversal of 3201313344031 is 1304433131023.
3201313344031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 3201313344031 - 239 = 2651557530143 is a prime.
It is a super-2 number, since 2×32013133440312 (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 (3201313344041) 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, 134598880 + ... + 134622661.
It is an arithmetic number, because the mean of its divisors is an integer number (232607412288).
Almost surely, 23201313344031 is an apocalyptic number.
3201313344031 is a deficient number, since it is larger than the sum of its proper divisors (520405252577).
3201313344031 is a wasteful number, since it uses less digits than its factorization.
3201313344031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269221622.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 3201313344031 its reverse (1304433131023), we get a palindrome (4505746475054).
The spelling of 3201313344031 in words is "three trillion, two hundred one billion, three hundred thirteen million, three hundred forty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •