Base | Representation |
---|---|
bin | 100000110101011100010010… |
… | …110111110000100001010001 |
3 | 200221022110110100000212001212 |
4 | 200311130102313300201101 |
5 | 122412003141002444303 |
6 | 1231045012234505505 |
7 | 42263164320555014 |
oct | 4065342267604121 |
9 | 627273410025055 |
10 | 144410001999953 |
11 | 42016a35405878 |
12 | 14243761595295 |
13 | 6276a60085021 |
14 | 27936a4d1337b |
15 | 11a667eee5ad8 |
hex | 835712df0851 |
144410001999953 has 2 divisors, whose sum is σ = 144410001999954. Its totient is φ = 144410001999952.
The previous prime is 144410001999947. The next prime is 144410002000001. The reversal of 144410001999953 is 359999100014441.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 74728711508929 + 69681290491024 = 8644577^2 + 8347532^2 .
It is a cyclic number.
It is not a de Polignac number, because 144410001999953 - 222 = 144409997805649 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 144410001999892 and 144410001999901.
It is not a weakly prime, because it can be changed into another prime (144410001999853) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 72205000999976 + 72205000999977.
It is an arithmetic number, because the mean of its divisors is an integer number (72205000999977).
Almost surely, 2144410001999953 is an apocalyptic number.
It is an amenable number.
144410001999953 is a deficient number, since it is larger than the sum of its proper divisors (1).
144410001999953 is an equidigital number, since it uses as much as digits as its factorization.
144410001999953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6298560, while the sum is 59.
The spelling of 144410001999953 in words is "one hundred forty-four trillion, four hundred ten billion, one million, nine hundred ninety-nine thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •