Base | Representation |
---|---|
bin | 10001001100100… |
… | …11111000101111 |
3 | 101001110012102020 |
4 | 20212103320233 |
5 | 243412320110 |
6 | 22152001223 |
7 | 3401124000 |
oct | 1046237057 |
9 | 331405366 |
10 | 144260655 |
11 | 74482190 |
12 | 40390213 |
13 | 23b6c746 |
14 | 152331a7 |
15 | c9e8d70 |
hex | 8993e2f |
144260655 has 64 divisors (see below), whose sum is σ = 293760000. Its totient is φ = 59928960.
The previous prime is 144260653. The next prime is 144260663. The reversal of 144260655 is 556062441.
It is not a de Polignac number, because 144260655 - 21 = 144260653 is a prime.
It is a super-2 number, since 2×1442606552 = 41622273162058050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144260653) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 55321 + ... + 57869.
It is an arithmetic number, because the mean of its divisors is an integer number (4590000).
Almost surely, 2144260655 is an apocalyptic number.
144260655 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
144260655 is an abundant number, since it is smaller than the sum of its proper divisors (149499345).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144260655 is a wasteful number, since it uses less digits than its factorization.
144260655 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2589 (or 2575 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 33.
The square root of 144260655 is about 12010.8557147274. The cubic root of 144260655 is about 524.4643425435.
The spelling of 144260655 in words is "one hundred forty-four million, two hundred sixty thousand, six hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •