Base | Representation |
---|---|
bin | 10001001100100… |
… | …11110101000101 |
3 | 101001110012002120 |
4 | 20212103311011 |
5 | 243412313141 |
6 | 22152000153 |
7 | 3401123214 |
oct | 1046236505 |
9 | 331405076 |
10 | 144260421 |
11 | 74481a98 |
12 | 40390059 |
13 | 23b6c5c6 |
14 | 1523307b |
15 | c9e8c66 |
hex | 8993d45 |
144260421 has 8 divisors (see below), whose sum is σ = 194252064. Its totient is φ = 95221200.
The previous prime is 144260411. The next prime is 144260429. The reversal of 144260421 is 124062441.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 144260421 - 26 = 144260357 is a prime.
It is a super-2 number, since 2×1442604212 = 41622138134194482, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 144260391 and 144260400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144260429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 237751 + ... + 238356.
It is an arithmetic number, because the mean of its divisors is an integer number (24281508).
Almost surely, 2144260421 is an apocalyptic number.
It is an amenable number.
144260421 is a deficient number, since it is larger than the sum of its proper divisors (49991643).
144260421 is a wasteful number, since it uses less digits than its factorization.
144260421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 476211.
The product of its (nonzero) digits is 1536, while the sum is 24.
The square root of 144260421 is about 12010.8459735358. The cubic root of 144260421 is about 524.4640589718.
The spelling of 144260421 in words is "one hundred forty-four million, two hundred sixty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •