Base | Representation |
---|---|
bin | 100000101111111111011110… |
… | …110000001001100100010011 |
3 | 200212222122201020102000211012 |
4 | 200233333132300021210103 |
5 | 122334334113122413121 |
6 | 1230200551312241135 |
7 | 42224135051363114 |
oct | 4057773660114423 |
9 | 625878636360735 |
10 | 144035465435411 |
11 | 41992109272410 |
12 | 141a3055b401ab |
13 | 624a641ca2374 |
14 | 277d4d489220b |
15 | 119ba5dd13c5b |
hex | 82ffdec09913 |
144035465435411 has 16 divisors (see below), whose sum is σ = 161418011152608. Its totient is φ = 127385749708800.
The previous prime is 144035465435363. The next prime is 144035465435419. The reversal of 144035465435411 is 114534564530441.
It is a de Polignac number, because none of the positive numbers 2k-144035465435411 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 144035465435411.
It is not an unprimeable number, because it can be changed into a prime (144035465435419) 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, 452204966 + ... + 452523371.
It is an arithmetic number, because the mean of its divisors is an integer number (10088625697038).
Almost surely, 2144035465435411 is an apocalyptic number.
144035465435411 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
144035465435411 is a deficient number, since it is larger than the sum of its proper divisors (17382545717197).
144035465435411 is a wasteful number, since it uses less digits than its factorization.
144035465435411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 904728742.
The product of its (nonzero) digits is 6912000, while the sum is 50.
The spelling of 144035465435411 in words is "one hundred forty-four trillion, thirty-five billion, four hundred sixty-five million, four hundred thirty-five thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •