Base | Representation |
---|---|
bin | 100000110000111100100111… |
… | …101011011001000000010011 |
3 | 200220012221011100200220021012 |
4 | 200300330213223121000103 |
5 | 122341423040014343011 |
6 | 1230251045420521135 |
7 | 42231650632225310 |
oct | 4060744753310023 |
9 | 626187140626235 |
10 | 144101113434131 |
11 | 41a07a36909507 |
12 | 141b39173b01ab |
13 | 62538a48c1219 |
14 | 27827614c5d07 |
15 | 119d60231ca8b |
hex | 830f27ad9013 |
144101113434131 has 16 divisors (see below), whose sum is σ = 165844727313408. Its totient is φ = 122649954885600.
The previous prime is 144101113434079. The next prime is 144101113434151. The reversal of 144101113434131 is 131434311101441.
It is a cyclic number.
It is not a de Polignac number, because 144101113434131 - 210 = 144101113433107 is a prime.
It is a super-2 number, since 2×1441011134341312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (144101113434151) 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, 125268740 + ... + 126413841.
It is an arithmetic number, because the mean of its divisors is an integer number (10365295457088).
Almost surely, 2144101113434131 is an apocalyptic number.
144101113434131 is a deficient number, since it is larger than the sum of its proper divisors (21743613879277).
144101113434131 is a wasteful number, since it uses less digits than its factorization.
144101113434131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251683162.
The product of its (nonzero) digits is 6912, while the sum is 32.
Adding to 144101113434131 its reverse (131434311101441), we get a palindrome (275535424535572).
The spelling of 144101113434131 in words is "one hundred forty-four trillion, one hundred one billion, one hundred thirteen million, four hundred thirty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •