Base | Representation |
---|---|
bin | 11010000101001110… |
… | …11001100010110101 |
3 | 1100010212020001010111 |
4 | 31002213121202311 |
5 | 212134121321024 |
6 | 10233242423021 |
7 | 1003665340045 |
oct | 150247314265 |
9 | 40125201114 |
10 | 14002526389 |
11 | 5a36074365 |
12 | 2869501a71 |
13 | 1421cb4a97 |
14 | 96b973725 |
15 | 56e481a94 |
hex | 3429d98b5 |
14002526389 has 4 divisors (see below), whose sum is σ = 14002853760. Its totient is φ = 14002199020.
The previous prime is 14002526359. The next prime is 14002526399. The reversal of 14002526389 is 98362520041.
14002526389 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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.
It is a cyclic number.
It is not a de Polignac number, because 14002526389 - 231 = 11855042741 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 (14002526359) 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 3 ways as a sum of consecutive naturals, for example, 87799 + ... + 188980.
It is an arithmetic number, because the mean of its divisors is an integer number (3500713440).
Almost surely, 214002526389 is an apocalyptic number.
It is an amenable number.
14002526389 is a deficient number, since it is larger than the sum of its proper divisors (327371).
14002526389 is an equidigital number, since it uses as much as digits as its factorization.
14002526389 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327370.
The product of its (nonzero) digits is 103680, while the sum is 40.
The spelling of 14002526389 in words is "fourteen billion, two million, five hundred twenty-six thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •