Base | Representation |
---|---|
bin | 1101001000101100100001… |
… | …0001111111110010110101 |
3 | 1220010202000022020112110221 |
4 | 3102023020101333302311 |
5 | 3343113321243210401 |
6 | 50415012512214341 |
7 | 3020322000116506 |
oct | 322131021776265 |
9 | 56122008215427 |
10 | 14443040210101 |
11 | 466929373a958 |
12 | 17531a8b3a3b1 |
13 | 809c85467419 |
14 | 37d0928b0bad |
15 | 1a0a6b1667a1 |
hex | d22c847fcb5 |
14443040210101 has 2 divisors, whose sum is σ = 14443040210102. Its totient is φ = 14443040210100.
The previous prime is 14443040210089. The next prime is 14443040210141. The reversal of 14443040210101 is 10101204034441.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10613684358225 + 3829355851876 = 3257865^2 + 1956874^2 .
It is a cyclic number.
It is not a de Polignac number, because 14443040210101 - 217 = 14443040079029 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (14443040210141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 7221520105050 + 7221520105051.
It is an arithmetic number, because the mean of its divisors is an integer number (7221520105051).
Almost surely, 214443040210101 is an apocalyptic number.
It is an amenable number.
14443040210101 is a deficient number, since it is larger than the sum of its proper divisors (1).
14443040210101 is an equidigital number, since it uses as much as digits as its factorization.
14443040210101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 14443040210101 its reverse (10101204034441), we get a palindrome (24544244244542).
The spelling of 14443040210101 in words is "fourteen trillion, four hundred forty-three billion, forty million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •