Base | Representation |
---|---|
bin | 11011110110001000… |
… | …00101000111001101 |
3 | 1102120212020210022202 |
4 | 31323010011013031 |
5 | 221104042201343 |
6 | 10511233051245 |
7 | 1036315145123 |
oct | 157304050715 |
9 | 42525223282 |
10 | 14949568973 |
11 | 6381707489 |
12 | 2a926b6b25 |
13 | 154326c701 |
14 | a1b657913 |
15 | 5c76a1db8 |
hex | 37b1051cd |
14949568973 has 2 divisors, whose sum is σ = 14949568974. Its totient is φ = 14949568972.
The previous prime is 14949568943. The next prime is 14949568979. The reversal of 14949568973 is 37986594941.
14949568973 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14947018564 + 2550409 = 122258^2 + 1597^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14949568973 is a prime.
It is a super-2 number, since 2×149495689732 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14949568979) 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 as a sum of consecutive naturals, namely, 7474784486 + 7474784487.
It is an arithmetic number, because the mean of its divisors is an integer number (7474784487).
Almost surely, 214949568973 is an apocalyptic number.
It is an amenable number.
14949568973 is a deficient number, since it is larger than the sum of its proper divisors (1).
14949568973 is an equidigital number, since it uses as much as digits as its factorization.
14949568973 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 58786560, while the sum is 65.
The spelling of 14949568973 in words is "fourteen billion, nine hundred forty-nine million, five hundred sixty-eight thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •