Base | Representation |
---|---|
bin | 100001101011001100111… |
… | …101101101001011000001 |
3 | 22012020011202222211002222 |
4 | 201223030331231023001 |
5 | 300403320032224441 |
6 | 4531032553220425 |
7 | 326122220036303 |
oct | 41531475551301 |
9 | 8166152884088 |
10 | 2314131133121 |
11 | 8124657715a5 |
12 | 3145b1a01715 |
13 | 13a2b5bc62c2 |
14 | 8000c681973 |
15 | 402e1073d4b |
hex | 21accf6d2c1 |
2314131133121 has 8 divisors (see below), whose sum is σ = 2388802328064. Its totient is φ = 2239461300960.
The previous prime is 2314131133063. The next prime is 2314131133129. The reversal of 2314131133121 is 1213311314132.
2314131133121 is digitally balanced in base 2, 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 a cyclic number.
It is not a de Polignac number, because 2314131133121 - 26 = 2314131133057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2314131133129) 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, 3980396 + ... + 4524578.
It is an arithmetic number, because the mean of its divisors is an integer number (298600291008).
Almost surely, 22314131133121 is an apocalyptic number.
It is an amenable number.
2314131133121 is a deficient number, since it is larger than the sum of its proper divisors (74671194943).
2314131133121 is a wasteful number, since it uses less digits than its factorization.
2314131133121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 681391.
The product of its digits is 1296, while the sum is 26.
Adding to 2314131133121 its reverse (1213311314132), we get a palindrome (3527442447253).
The spelling of 2314131133121 in words is "two trillion, three hundred fourteen billion, one hundred thirty-one million, one hundred thirty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •