Base | Representation |
---|---|
bin | 11011000011111001… |
… | …01011110100001101 |
3 | 1101111111101000200121 |
4 | 31201330223310031 |
5 | 214223204344244 |
6 | 10401341424541 |
7 | 1023010443034 |
oct | 154174536415 |
9 | 41444330617 |
10 | 14528199949 |
11 | 618587671a |
12 | 299556b151 |
13 | 14a6b88823 |
14 | 9bb6cd71b |
15 | 5a06bbc84 |
hex | 361f2bd0d |
14528199949 has 4 divisors (see below), whose sum is σ = 15382799964. Its totient is φ = 13673599936.
The previous prime is 14528199947. The next prime is 14528199991. The reversal of 14528199949 is 94999182541.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 11100097449 + 3428102500 = 105357^2 + 58550^2 .
It is not a de Polignac number, because 14528199949 - 21 = 14528199947 is a prime.
It is a super-2 number, since 2×145281999492 (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 (14528199947) 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, 427299982 + ... + 427300015.
It is an arithmetic number, because the mean of its divisors is an integer number (3845699991).
Almost surely, 214528199949 is an apocalyptic number.
It is an amenable number.
14528199949 is a deficient number, since it is larger than the sum of its proper divisors (854600015).
14528199949 is an equidigital number, since it uses as much as digits as its factorization.
14528199949 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 854600014.
The product of its digits is 8398080, while the sum is 61.
The spelling of 14528199949 in words is "fourteen billion, five hundred twenty-eight million, one hundred ninety-nine thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •