Base | Representation |
---|---|
bin | 100000110110111100010000… |
… | …100110010111101011000001 |
3 | 200221200022102110001012121120 |
4 | 200312330100212113223001 |
5 | 122420200203013234101 |
6 | 1231204213035142453 |
7 | 42303502632515301 |
oct | 4066742046275301 |
9 | 627608373035546 |
10 | 144513043102401 |
11 | 42056701425186 |
12 | 1425b7198a4a29 |
13 | 62836a193a56c |
14 | 279867bbd9601 |
15 | 11a91b11e2b36 |
hex | 836f10997ac1 |
144513043102401 has 4 divisors (see below), whose sum is σ = 192684057469872. Its totient is φ = 96342028734932.
The previous prime is 144513043102399. The next prime is 144513043102481. The reversal of 144513043102401 is 104201340315441.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 144513043102401 - 21 = 144513043102399 is a prime.
It is not an unprimeable number, because it can be changed into a prime (144513043102481) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 24085507183731 + ... + 24085507183736.
It is an arithmetic number, because the mean of its divisors is an integer number (48171014367468).
Almost surely, 2144513043102401 is an apocalyptic number.
It is an amenable number.
144513043102401 is a deficient number, since it is larger than the sum of its proper divisors (48171014367471).
144513043102401 is an equidigital number, since it uses as much as digits as its factorization.
144513043102401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48171014367470.
The product of its (nonzero) digits is 23040, while the sum is 33.
Adding to 144513043102401 its reverse (104201340315441), we get a palindrome (248714383417842).
The spelling of 144513043102401 in words is "one hundred forty-four trillion, five hundred thirteen billion, forty-three million, one hundred two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •