Base | Representation |
---|---|
bin | 101101100011001001110… |
… | …000011101001001100101 |
3 | 102002020101112002202112112 |
4 | 231203021300131021211 |
5 | 402240442001123323 |
6 | 10353542514330405 |
7 | 442100214323102 |
oct | 55431160351145 |
9 | 12066345082475 |
10 | 3130121114213 |
11 | aa75278487a5 |
12 | 42677b289a05 |
13 | 19922782b842 |
14 | ab6da4cbaa9 |
15 | 5664d02d178 |
hex | 2d8c9c1d265 |
3130121114213 has 8 divisors (see below), whose sum is σ = 3196752728832. Its totient is φ = 3063490886896.
The previous prime is 3130121114161. The next prime is 3130121114287. The reversal of 3130121114213 is 3124111210313.
3130121114213 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3130121114213 - 28 = 3130121113957 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 (3130141114213) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5121731 + ... + 5700207.
It is an arithmetic number, because the mean of its divisors is an integer number (399594091104).
Almost surely, 23130121114213 is an apocalyptic number.
It is an amenable number.
3130121114213 is a deficient number, since it is larger than the sum of its proper divisors (66631614619).
3130121114213 is a wasteful number, since it uses less digits than its factorization.
3130121114213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 693651.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 3130121114213 its reverse (3124111210313), we get a palindrome (6254232324526).
The spelling of 3130121114213 in words is "three trillion, one hundred thirty billion, one hundred twenty-one million, one hundred fourteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •