Base | Representation |
---|---|
bin | 11010000110001111… |
… | …11010100011111001 |
3 | 1100011110021002122102 |
4 | 31003013322203321 |
5 | 212143312101413 |
6 | 10234145233145 |
7 | 1004130650645 |
oct | 150307724371 |
9 | 40143232572 |
10 | 14011050233 |
11 | 5a3a966464 |
12 | 28703327b5 |
13 | 14239aa78b |
14 | 96cb51c25 |
15 | 5700b7458 |
hex | 3431fa8f9 |
14011050233 has 4 divisors (see below), whose sum is σ = 14037840528. Its totient is φ = 13984259940.
The previous prime is 14011050203. The next prime is 14011050239. The reversal of 14011050233 is 33205011041.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 33205011041 = 233 ⋅142510777.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14011050233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14011050239) 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, 13394363 + ... + 13395408.
It is an arithmetic number, because the mean of its divisors is an integer number (3509460132).
Almost surely, 214011050233 is an apocalyptic number.
It is an amenable number.
14011050233 is a deficient number, since it is larger than the sum of its proper divisors (26790295).
14011050233 is an equidigital number, since it uses as much as digits as its factorization.
14011050233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26790294.
The product of its (nonzero) digits is 360, while the sum is 20.
Adding to 14011050233 its reverse (33205011041), we get a palindrome (47216061274).
The spelling of 14011050233 in words is "fourteen billion, eleven million, fifty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •