Base | Representation |
---|---|
bin | 11011110110000111… |
… | …10011000010011101 |
3 | 1102120212010000202211 |
4 | 31323003303002131 |
5 | 221104032314231 |
6 | 10511231320421 |
7 | 1036314416233 |
oct | 157303630235 |
9 | 42525100684 |
10 | 14949494941 |
11 | 63816668a7 |
12 | 2a92680111 |
13 | 1543244ac4 |
14 | a1b638953 |
15 | 5c7689eb1 |
hex | 37b0f309d |
14949494941 has 8 divisors (see below), whose sum is σ = 15061056120. Its totient is φ = 14838140928.
The previous prime is 14949494933. The next prime is 14949494947.
14949494941 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 4 ways, for example, as 200364025 + 14749130916 = 14155^2 + 121446^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 14949494941 - 23 = 14949494933 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14949494947) 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 7 ways as a sum of consecutive naturals, for example, 94605 + ... + 197101.
It is an arithmetic number, because the mean of its divisors is an integer number (1882632015).
Almost surely, 214949494941 is an apocalyptic number.
It is an amenable number.
14949494941 is a deficient number, since it is larger than the sum of its proper divisors (111561179).
14949494941 is a wasteful number, since it uses less digits than its factorization.
14949494941 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103583.
The product of its digits is 6718464, while the sum is 58.
The spelling of 14949494941 in words is "fourteen billion, nine hundred forty-nine million, four hundred ninety-four thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.086 sec. • engine limits •