Base | Representation |
---|---|
bin | 100000110100011100111110… |
… | …010100010010001000011101 |
3 | 200221001221221221202120221220 |
4 | 200310130332110102020131 |
5 | 122404344414410434323 |
6 | 1230553445444443553 |
7 | 42255236413306254 |
oct | 4064347624221035 |
9 | 627057857676856 |
10 | 144342011421213 |
11 | 41aa0115505731 |
12 | 142325476a95b9 |
13 | 6270516033048 |
14 | 279029512979b |
15 | 11a4a010090e3 |
hex | 83473e51221d |
144342011421213 has 24 divisors (see below), whose sum is σ = 204444759646272. Its totient is φ = 90566710577664.
The previous prime is 144342011421211. The next prime is 144342011421221. The reversal of 144342011421213 is 312124110243441.
It is not a de Polignac number, because 144342011421213 - 21 = 144342011421211 is a prime.
It is a super-2 number, since 2×1443420114212132 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144342011421211) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 102444681 + ... + 103844097.
It is an arithmetic number, because the mean of its divisors is an integer number (8518531651928).
Almost surely, 2144342011421213 is an apocalyptic number.
It is an amenable number.
144342011421213 is a deficient number, since it is larger than the sum of its proper divisors (60102748225059).
144342011421213 is a wasteful number, since it uses less digits than its factorization.
144342011421213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1518421 (or 1518404 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 33.
Adding to 144342011421213 its reverse (312124110243441), we get a palindrome (456466121664654).
The spelling of 144342011421213 in words is "one hundred forty-four trillion, three hundred forty-two billion, eleven million, four hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •