Base | Representation |
---|---|
bin | 11010001010111100… |
… | …00111010100111011 |
3 | 1100021012100111110122 |
4 | 31011132013110323 |
5 | 212233402032443 |
6 | 10242113203455 |
7 | 1005116430431 |
oct | 150536072473 |
9 | 40235314418 |
10 | 14050424123 |
11 | 5a6010966a |
12 | 288156058b |
13 | 142bbb5338 |
14 | 974080d51 |
15 | 573793968 |
hex | 34578753b |
14050424123 has 4 divisors (see below), whose sum is σ = 14136623208. Its totient is φ = 13964225040.
The previous prime is 14050424117. The next prime is 14050424149. The reversal of 14050424123 is 32142405041.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 32142405041 = 929 ⋅34598929.
It is a cyclic number.
It is not a de Polignac number, because 14050424123 - 222 = 14046229819 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14050424092 and 14050424101.
It is not an unprimeable number, because it can be changed into a prime (14050424153) 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 3 ways as a sum of consecutive naturals, for example, 43099298 + ... + 43099623.
It is an arithmetic number, because the mean of its divisors is an integer number (3534155802).
Almost surely, 214050424123 is an apocalyptic number.
14050424123 is a deficient number, since it is larger than the sum of its proper divisors (86199085).
14050424123 is an equidigital number, since it uses as much as digits as its factorization.
14050424123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86199084.
The product of its (nonzero) digits is 3840, while the sum is 26.
Adding to 14050424123 its reverse (32142405041), we get a palindrome (46192829164).
The spelling of 14050424123 in words is "fourteen billion, fifty million, four hundred twenty-four thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •