Base | Representation |
---|---|
bin | 11010100000011001… |
… | …10101010101001111 |
3 | 1100201202002102102011 |
4 | 31100030311111033 |
5 | 213120443141333 |
6 | 10312023442051 |
7 | 1012433526004 |
oct | 152014652517 |
9 | 40652072364 |
10 | 14230443343 |
11 | 6042794786 |
12 | 29118b6327 |
13 | 145a294b9c |
14 | 98dd418ab |
15 | 5844a29cd |
hex | 35033554f |
14230443343 has 8 divisors (see below), whose sum is σ = 14528498256. Its totient is φ = 13933483200.
The previous prime is 14230443301. The next prime is 14230443361. The reversal of 14230443343 is 34334403241.
14230443343 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 14230443343 - 225 = 14196888911 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14230443943) 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 7 ways as a sum of consecutive naturals, for example, 247398 + ... + 299443.
It is an arithmetic number, because the mean of its divisors is an integer number (1816062282).
Almost surely, 214230443343 is an apocalyptic number.
14230443343 is a deficient number, since it is larger than the sum of its proper divisors (298054913).
14230443343 is an equidigital number, since it uses as much as digits as its factorization.
14230443343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 547385.
The product of its (nonzero) digits is 41472, while the sum is 31.
Adding to 14230443343 its reverse (34334403241), we get a palindrome (48564846584).
The spelling of 14230443343 in words is "fourteen billion, two hundred thirty million, four hundred forty-three thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.225 sec. • engine limits •