Base | Representation |
---|---|
bin | 101101011010110111111… |
… | …011101011000000110101 |
3 | 102001101110000220120200202 |
4 | 231122313323223000311 |
5 | 402114240411130401 |
6 | 10345512500450245 |
7 | 441334020234401 |
oct | 55326773530065 |
9 | 12041400816622 |
10 | 3121232130101 |
11 | aa3786192438 |
12 | 424aba3a9985 |
13 | 19843c07b127 |
14 | ab0d5b34101 |
15 | 562cc98006b |
hex | 2d6b7eeb035 |
3121232130101 has 4 divisors (see below), whose sum is σ = 3256937874912. Its totient is φ = 2985526385292.
The previous prime is 3121232130097. The next prime is 3121232130131. The reversal of 3121232130101 is 1010312321213.
It is a happy number.
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 3121232130101 - 22 = 3121232130097 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 (3121232130131) 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, 67852872371 + ... + 67852872416.
It is an arithmetic number, because the mean of its divisors is an integer number (814234468728).
Almost surely, 23121232130101 is an apocalyptic number.
It is an amenable number.
3121232130101 is a deficient number, since it is larger than the sum of its proper divisors (135705744811).
3121232130101 is a wasteful number, since it uses less digits than its factorization.
3121232130101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135705744810.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 3121232130101 its reverse (1010312321213), we get a palindrome (4131544451314).
The spelling of 3121232130101 in words is "three trillion, one hundred twenty-one billion, two hundred thirty-two million, one hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •