Base | Representation |
---|---|
bin | 10001010000010… |
… | …01010011110111 |
3 | 101002100122011212 |
4 | 20220021103313 |
5 | 244023212443 |
6 | 22210152035 |
7 | 3405166145 |
oct | 1050112367 |
9 | 332318155 |
10 | 144741623 |
11 | 74780584 |
12 | 4058261b |
13 | 23caa640 |
14 | 1531a595 |
15 | ca91618 |
hex | 8a094f7 |
144741623 has 8 divisors (see below), whose sum is σ = 159192768. Its totient is φ = 130764384.
The previous prime is 144741617. The next prime is 144741631. The reversal of 144741623 is 326147441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 144741623 - 26 = 144741559 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 144741623.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144741823) 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, 117836 + ... + 119057.
It is an arithmetic number, because the mean of its divisors is an integer number (19899096).
Almost surely, 2144741623 is an apocalyptic number.
144741623 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
144741623 is a deficient number, since it is larger than the sum of its proper divisors (14451145).
144741623 is a wasteful number, since it uses less digits than its factorization.
144741623 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236953.
The product of its digits is 16128, while the sum is 32.
The square root of 144741623 is about 12030.8612742397. The cubic root of 144741623 is about 525.0465542995.
The spelling of 144741623 in words is "one hundred forty-four million, seven hundred forty-one thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •