Base | Representation |
---|---|
bin | 101101011010110000110… |
… | …101010110100100110101 |
3 | 102001101010201210211012111 |
4 | 231122300311112210311 |
5 | 402114014414024023 |
6 | 10345453004051021 |
7 | 441331043023513 |
oct | 55326065264465 |
9 | 12041121724174 |
10 | 3121113033013 |
11 | aa3724a37a98 |
12 | 424a86533a71 |
13 | 1984204ac191 |
14 | ab0c3db14b3 |
15 | 562c22a700d |
hex | 2d6b0d56935 |
3121113033013 has 4 divisors (see below), whose sum is σ = 3121118849548. Its totient is φ = 3121107216480.
The previous prime is 3121113033001. The next prime is 3121113033061. The reversal of 3121113033013 is 3103303111213.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1930271192964 + 1190841840049 = 1389342^2 + 1091257^2 .
It is a cyclic number.
It is not a de Polignac number, because 3121113033013 - 225 = 3121079478581 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3121113003013) 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, 2011128 + ... + 3207313.
It is an arithmetic number, because the mean of its divisors is an integer number (780279712387).
Almost surely, 23121113033013 is an apocalyptic number.
It is an amenable number.
3121113033013 is a deficient number, since it is larger than the sum of its proper divisors (5816535).
3121113033013 is an equidigital number, since it uses as much as digits as its factorization.
3121113033013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5816534.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 3121113033013 its reverse (3103303111213), we get a palindrome (6224416144226).
The spelling of 3121113033013 in words is "three trillion, one hundred twenty-one billion, one hundred thirteen million, thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •