Base | Representation |
---|---|
bin | 11010101001111001… |
… | …10100010110101001 |
3 | 1100221022000222111001 |
4 | 31110330310112221 |
5 | 213301343143423 |
6 | 10323551435001 |
7 | 1014422051605 |
oct | 152474642651 |
9 | 40838028431 |
10 | 14310131113 |
11 | 6083772343 |
12 | 2934525a61 |
13 | 1470946105 |
14 | 99a766505 |
15 | 58b493cad |
hex | 354f345a9 |
14310131113 has 4 divisors (see below), whose sum is σ = 14803583940. Its totient is φ = 13816678288.
The previous prime is 14310131111. The next prime is 14310131131. The reversal of 14310131113 is 31113101341.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31113101341 = 7 ⋅4444728763.
It can be written as a sum of positive squares in 2 ways, for example, as 4922846569 + 9387284544 = 70163^2 + 96888^2 .
It is a cyclic number.
It is not a de Polignac number, because 14310131113 - 21 = 14310131111 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14310131111) 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, 246726370 + ... + 246726427.
It is an arithmetic number, because the mean of its divisors is an integer number (3700895985).
Almost surely, 214310131113 is an apocalyptic number.
It is an amenable number.
14310131113 is a deficient number, since it is larger than the sum of its proper divisors (493452827).
14310131113 is an equidigital number, since it uses as much as digits as its factorization.
14310131113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 493452826.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 14310131113 its reverse (31113101341), we get a palindrome (45423232454).
The spelling of 14310131113 in words is "fourteen billion, three hundred ten million, one hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •