Base | Representation |
---|---|
bin | 101101101111001011001… |
… | …111110101111010010001 |
3 | 102010110201020100222121210 |
4 | 231233023033311322101 |
5 | 402443411420134301 |
6 | 10403515530410333 |
7 | 443035144606641 |
oct | 55571317657221 |
9 | 12113636328553 |
10 | 3143031021201 |
11 | 1001a52088a15 |
12 | 4291828909a9 |
13 | 19a504348166 |
14 | ac1a2cc4521 |
15 | 56b565d5ad6 |
hex | 2dbcb3f5e91 |
3143031021201 has 4 divisors (see below), whose sum is σ = 4190708028272. Its totient is φ = 2095354014132.
The previous prime is 3143031021161. The next prime is 3143031021217. The reversal of 3143031021201 is 1021201303413.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 3143031021201 - 213 = 3143031013009 is a prime.
It is a super-2 number, since 2×31430310212012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3143031021101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 523838503531 + ... + 523838503536.
It is an arithmetic number, because the mean of its divisors is an integer number (1047677007068).
Almost surely, 23143031021201 is an apocalyptic number.
It is an amenable number.
3143031021201 is a deficient number, since it is larger than the sum of its proper divisors (1047677007071).
3143031021201 is a wasteful number, since it uses less digits than its factorization.
3143031021201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1047677007070.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 3143031021201 its reverse (1021201303413), we get a palindrome (4164232324614).
The spelling of 3143031021201 in words is "three trillion, one hundred forty-three billion, thirty-one million, twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •