Base | Representation |
---|---|
bin | 11010101000110100… |
… | …11010011101000011 |
3 | 1100220200001202202200 |
4 | 31110122122131003 |
5 | 213242041042011 |
6 | 10323030244243 |
7 | 1014252306315 |
oct | 152432323503 |
9 | 40820052680 |
10 | 14301112131 |
11 | 6079672239 |
12 | 29314b6683 |
13 | 146bb08c37 |
14 | 9994997b5 |
15 | 58a7b1856 |
hex | 35469a743 |
14301112131 has 12 divisors (see below), whose sum is σ = 20660217552. Its totient is φ = 9532664496.
The previous prime is 14301112073. The next prime is 14301112183. The reversal of 14301112131 is 13121110341.
It is a happy number.
14301112131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14301112131 - 27 = 14301112003 is a prime.
It is a super-2 number, since 2×143011121312 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (14301111131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 51336 + ... + 176741.
It is an arithmetic number, because the mean of its divisors is an integer number (1721684796).
Almost surely, 214301112131 is an apocalyptic number.
14301112131 is a deficient number, since it is larger than the sum of its proper divisors (6359105421).
14301112131 is a wasteful number, since it uses less digits than its factorization.
14301112131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235050 (or 235047 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 14301112131 its reverse (13121110341), we get a palindrome (27422222472).
The spelling of 14301112131 in words is "fourteen billion, three hundred one million, one hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •