Base | Representation |
---|---|
bin | 101111000001010010100… |
… | …110000111101100110001 |
3 | 102102220021221222122201120 |
4 | 233001102212013230301 |
5 | 410414444442200223 |
6 | 10512220542052453 |
7 | 452306114306361 |
oct | 57012246075461 |
9 | 12386257878646 |
10 | 3231201131313 |
11 | 103638788a711 |
12 | 44228a87a129 |
13 | 1a591601354c |
14 | b2568b689a1 |
15 | 590b6ea2be3 |
hex | 2f052987b31 |
3231201131313 has 4 divisors (see below), whose sum is σ = 4308268175088. Its totient is φ = 2154134087540.
The previous prime is 3231201131273. The next prime is 3231201131363. The reversal of 3231201131313 is 3131311021323.
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 a cyclic number.
It is not a de Polignac number, because 3231201131313 - 213 = 3231201123121 is a prime.
It is a super-2 number, since 2×32312011313132 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3231201131363) 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, 538533521883 + ... + 538533521888.
It is an arithmetic number, because the mean of its divisors is an integer number (1077067043772).
Almost surely, 23231201131313 is an apocalyptic number.
It is an amenable number.
3231201131313 is a deficient number, since it is larger than the sum of its proper divisors (1077067043775).
3231201131313 is a wasteful number, since it uses less digits than its factorization.
3231201131313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1077067043774.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 3231201131313 its reverse (3131311021323), we get a palindrome (6362512152636).
The spelling of 3231201131313 in words is "three trillion, two hundred thirty-one billion, two hundred one million, one hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •