Base | Representation |
---|---|
bin | 11010010100100011… |
… | …01011000111110111 |
3 | 1100110211001122221101 |
4 | 31022101223013313 |
5 | 212420022031301 |
6 | 10254113230531 |
7 | 1010115635305 |
oct | 151221530767 |
9 | 40424048841 |
10 | 14131048951 |
11 | 5aa1677258 |
12 | 28a4562447 |
13 | 1442803c36 |
14 | 980a6b275 |
15 | 57a8bc701 |
hex | 34a46b1f7 |
14131048951 has 2 divisors, whose sum is σ = 14131048952. Its totient is φ = 14131048950.
The previous prime is 14131048903. The next prime is 14131048963. The reversal of 14131048951 is 15984013141.
It is a strong prime.
It is an emirp because it is prime and its reverse (15984013141) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14131048951 - 29 = 14131048439 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14131048951.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14131048901) 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 as a sum of consecutive naturals, namely, 7065524475 + 7065524476.
It is an arithmetic number, because the mean of its divisors is an integer number (7065524476).
Almost surely, 214131048951 is an apocalyptic number.
14131048951 is a deficient number, since it is larger than the sum of its proper divisors (1).
14131048951 is an equidigital number, since it uses as much as digits as its factorization.
14131048951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 37.
The spelling of 14131048951 in words is "fourteen billion, one hundred thirty-one million, forty-eight thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •