Base | Representation |
---|---|
bin | 10001001101100… |
… | …00000111001101 |
3 | 101001200002000020 |
4 | 20212300013031 |
5 | 243430020034 |
6 | 22154252353 |
7 | 3402115032 |
oct | 1046600715 |
9 | 331602006 |
10 | 144376269 |
11 | 74551034 |
12 | 404270b9 |
13 | 23bb025b |
14 | 15263389 |
15 | ca1d249 |
hex | 89b01cd |
144376269 has 16 divisors (see below), whose sum is σ = 209172480. Its totient is φ = 88242480.
The previous prime is 144376247. The next prime is 144376289. The reversal of 144376269 is 962673441.
It is not a de Polignac number, because 144376269 - 25 = 144376237 is a prime.
It is a super-2 number, since 2×1443762692 = 41689014100720722, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 144376269.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144376229) 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, 39087 + ... + 42620.
It is an arithmetic number, because the mean of its divisors is an integer number (13073280).
Almost surely, 2144376269 is an apocalyptic number.
144376269 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
144376269 is a deficient number, since it is larger than the sum of its proper divisors (64796211).
144376269 is a wasteful number, since it uses less digits than its factorization.
144376269 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 81760.
The product of its digits is 217728, while the sum is 42.
The square root of 144376269 is about 12015.6676468684. The cubic root of 144376269 is about 524.6044112949.
It can be divided in two parts, 14437 and 6269, that added together give a triangular number (20706 = T203).
The spelling of 144376269 in words is "one hundred forty-four million, three hundred seventy-six thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •