Base | Representation |
---|---|
bin | 11011000100010000… |
… | …01011000101000101 |
3 | 1101111201001000212211 |
4 | 31202020023011011 |
5 | 214224442232324 |
6 | 10401530143421 |
7 | 1023045155236 |
oct | 154210130505 |
9 | 41451030784 |
10 | 14531211589 |
11 | 6187543384 |
12 | 2996581b71 |
13 | 14a76a156b |
14 | 9bbc7508d |
15 | 5a0ab4294 |
hex | 36220b145 |
14531211589 has 8 divisors (see below), whose sum is σ = 14733259992. Its totient is φ = 14329244160.
The previous prime is 14531211517. The next prime is 14531211599. The reversal of 14531211589 is 98511213541.
It can be written as a sum of positive squares in 4 ways, for example, as 402323364 + 14128888225 = 20058^2 + 118865^2 .
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 14531211589 - 215 = 14531178821 is a prime.
It is a super-2 number, since 2×145312115892 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14531211509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 401757 + ... + 436429.
It is an arithmetic number, because the mean of its divisors is an integer number (1841657499).
Almost surely, 214531211589 is an apocalyptic number.
It is an amenable number.
14531211589 is a deficient number, since it is larger than the sum of its proper divisors (202048403).
14531211589 is an equidigital number, since it uses as much as digits as its factorization.
14531211589 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40487.
The product of its digits is 43200, while the sum is 40.
The spelling of 14531211589 in words is "fourteen billion, five hundred thirty-one million, two hundred eleven thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •