Base | Representation |
---|---|
bin | 100000110101111001010111… |
… | …110011001110010110100001 |
3 | 200221102110001012020200020120 |
4 | 200311321113303032112201 |
5 | 122413011111120213101 |
6 | 1231111214253430453 |
7 | 42265351106512125 |
oct | 4065712763162641 |
9 | 627373035220216 |
10 | 144441223210401 |
11 | 420291a6a22337 |
12 | 1424981549b429 |
13 | 6279997459950 |
14 | 2794dc760d585 |
15 | 11a73aae49b36 |
hex | 835e57cce5a1 |
144441223210401 has 16 divisors (see below), whose sum is σ = 208455588057024. Its totient is φ = 88435704014784.
The previous prime is 144441223210399. The next prime is 144441223210409. The reversal of 144441223210401 is 104012322144441.
It is not a de Polignac number, because 144441223210401 - 21 = 144441223210399 is a prime.
It is a super-3 number, since 3×1444412232104013 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (144441223210409) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9400045891 + ... + 9400061256.
It is an arithmetic number, because the mean of its divisors is an integer number (13028474253564).
Almost surely, 2144441223210401 is an apocalyptic number.
It is an amenable number.
144441223210401 is a deficient number, since it is larger than the sum of its proper divisors (64014364846623).
144441223210401 is a wasteful number, since it uses less digits than its factorization.
144441223210401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18800107360.
The product of its (nonzero) digits is 24576, while the sum is 33.
Adding to 144441223210401 its reverse (104012322144441), we get a palindrome (248453545354842).
The spelling of 144441223210401 in words is "one hundred forty-four trillion, four hundred forty-one billion, two hundred twenty-three million, two hundred ten thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •