Base | Representation |
---|---|
bin | 11001111111111000011100… |
… | …110101000011000011101001 |
3 | 112222211220101001202101110002 |
4 | 121333320130311003003221 |
5 | 104441331034333203223 |
6 | 1043103324431232345 |
7 | 33040605060420536 |
oct | 3177703465030351 |
9 | 488756331671402 |
10 | 114341103022313 |
11 | 33483875876092 |
12 | 109a80a40786b5 |
13 | 4ba542064956b |
14 | 20341d3277d8d |
15 | d3441b5e4e28 |
hex | 67fe1cd430e9 |
114341103022313 has 4 divisors (see below), whose sum is σ = 114343359612288. Its totient is φ = 114338846432340.
The previous prime is 114341103022249. The next prime is 114341103022417. The reversal of 114341103022313 is 313220301143411.
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 114341103022313 - 26 = 114341103022249 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114341103022813) 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, 1128218981 + ... + 1128320322.
It is an arithmetic number, because the mean of its divisors is an integer number (28585839903072).
Almost surely, 2114341103022313 is an apocalyptic number.
It is an amenable number.
114341103022313 is a deficient number, since it is larger than the sum of its proper divisors (2256589975).
114341103022313 is an equidigital number, since it uses as much as digits as its factorization.
114341103022313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2256589974.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 114341103022313 its reverse (313220301143411), we get a palindrome (427561404165724).
The spelling of 114341103022313 in words is "one hundred fourteen trillion, three hundred forty-one billion, one hundred three million, twenty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •