Base | Representation |
---|---|
bin | 1100110001011011001100… |
… | …0001000110100001010001 |
3 | 1211201112002100020212022001 |
4 | 3030112303001012201101 |
5 | 3320041034341014022 |
6 | 45511214120514001 |
7 | 2646406602140365 |
oct | 314266301064121 |
9 | 54645070225261 |
10 | 14043251501137 |
11 | 4524789402651 |
12 | 16a981461b901 |
13 | 7ab371837781 |
14 | 3679a87cd2a5 |
15 | 19546d0a7b27 |
hex | cc5b3046851 |
14043251501137 has 2 divisors, whose sum is σ = 14043251501138. Its totient is φ = 14043251501136.
The previous prime is 14043251501119. The next prime is 14043251501161. The reversal of 14043251501137 is 73110515234041.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13891132780561 + 152118720576 = 3727081^2 + 390024^2 .
It is a cyclic number.
It is not a de Polignac number, because 14043251501137 - 231 = 14041104017489 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14043251501096 and 14043251501105.
It is not a weakly prime, because it can be changed into another prime (14043251501737) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7021625750568 + 7021625750569.
It is an arithmetic number, because the mean of its divisors is an integer number (7021625750569).
Almost surely, 214043251501137 is an apocalyptic number.
It is an amenable number.
14043251501137 is a deficient number, since it is larger than the sum of its proper divisors (1).
14043251501137 is an equidigital number, since it uses as much as digits as its factorization.
14043251501137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 50400, while the sum is 37.
Adding to 14043251501137 its reverse (73110515234041), we get a palindrome (87153766735178).
The spelling of 14043251501137 in words is "fourteen trillion, forty-three billion, two hundred fifty-one million, five hundred one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •