Base | Representation |
---|---|
bin | 11010100000011001… |
… | …01101011101111011 |
3 | 1100201202000210020010 |
4 | 31100030231131323 |
5 | 213120441124011 |
6 | 10312023033003 |
7 | 1012433333046 |
oct | 152014553573 |
9 | 40652023203 |
10 | 14230411131 |
11 | 6042772562 |
12 | 291189b763 |
13 | 145a283321 |
14 | 98dd33c5d |
15 | 5844981a6 |
hex | 35032d77b |
14230411131 has 8 divisors (see below), whose sum is σ = 19295472960. Its totient is φ = 9326145032.
The previous prime is 14230411123. The next prime is 14230411141. The reversal of 14230411131 is 13111403241.
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 14230411131 - 23 = 14230411123 is a prime.
It is a super-2 number, since 2×142304111312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14230411098 and 14230411107.
It is not an unprimeable number, because it can be changed into a prime (14230411141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40198725 + ... + 40199078.
It is an arithmetic number, because the mean of its divisors is an integer number (2411934120).
Almost surely, 214230411131 is an apocalyptic number.
14230411131 is a deficient number, since it is larger than the sum of its proper divisors (5065061829).
14230411131 is an equidigital number, since it uses as much as digits as its factorization.
14230411131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80397865.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 14230411131 its reverse (13111403241), we get a palindrome (27341814372).
The spelling of 14230411131 in words is "fourteen billion, two hundred thirty million, four hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •