Base | Representation |
---|---|
bin | 1100110001110110001110… |
… | …0011100111011000011101 |
3 | 1211202012211002012202001122 |
4 | 3030131203203213120131 |
5 | 3320200420111242244 |
6 | 45514414151220325 |
7 | 2650054460022623 |
oct | 314354343473035 |
9 | 54665732182048 |
10 | 14050508305949 |
11 | 45278727084a5 |
12 | 16ab0ba9776a5 |
13 | 7abc5a0c650b |
14 | 3680964b7513 |
15 | 1957451ec1ee |
hex | cc7638e761d |
14050508305949 has 2 divisors, whose sum is σ = 14050508305950. Its totient is φ = 14050508305948.
The previous prime is 14050508305829. The next prime is 14050508305961. The reversal of 14050508305949 is 94950380505041.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9962974590724 + 4087533715225 = 3156418^2 + 2021765^2 .
It is an emirp because it is prime and its reverse (94950380505041) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14050508305949 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14050508305949.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14050508305969) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7025254152974 + 7025254152975.
It is an arithmetic number, because the mean of its divisors is an integer number (7025254152975).
Almost surely, 214050508305949 is an apocalyptic number.
It is an amenable number.
14050508305949 is a deficient number, since it is larger than the sum of its proper divisors (1).
14050508305949 is an equidigital number, since it uses as much as digits as its factorization.
14050508305949 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888000, while the sum is 53.
The spelling of 14050508305949 in words is "fourteen trillion, fifty billion, five hundred eight million, three hundred five thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •