Base | Representation |
---|---|
bin | 1000011011000011001… |
… | …0101011100100011001 |
3 | 111211111101120102210110 |
4 | 2012300302223210121 |
5 | 4332321144341231 |
6 | 150250235034533 |
7 | 13311541450560 |
oct | 2066062534431 |
9 | 454441512713 |
10 | 144699996441 |
11 | 56404415020 |
12 | 2406389ba49 |
13 | 10850521290 |
14 | 7009918bd7 |
15 | 3b6d668046 |
hex | 21b0cab919 |
144699996441 has 64 divisors (see below), whose sum is σ = 259121479680. Its totient is φ = 69365687040.
The previous prime is 144699996431. The next prime is 144699996461.
144699996441 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 144699996441 - 226 = 144632887577 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (144699996431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 15367651 + ... + 15377063.
It is an arithmetic number, because the mean of its divisors is an integer number (4048773120).
Almost surely, 2144699996441 is an apocalyptic number.
144699996441 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
144699996441 is a deficient number, since it is larger than the sum of its proper divisors (114421483239).
144699996441 is a wasteful number, since it uses less digits than its factorization.
144699996441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14566.
The product of its digits is 60466176, while the sum is 66.
The spelling of 144699996441 in words is "one hundred forty-four billion, six hundred ninety-nine million, nine hundred ninety-six thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •