Base | Representation |
---|---|
bin | 10001001101001… |
… | …00111001100101 |
3 | 101001120202000012 |
4 | 20212210321211 |
5 | 243422032331 |
6 | 22153300005 |
7 | 3401534111 |
oct | 1046447145 |
9 | 331522005 |
10 | 144330341 |
11 | 7451a581 |
12 | 40404605 |
13 | 23b9538c |
14 | 15250741 |
15 | ca0e82b |
hex | 89a4e65 |
144330341 has 4 divisors (see below), whose sum is σ = 144643884. Its totient is φ = 144016800.
The previous prime is 144330337. The next prime is 144330349. The reversal of 144330341 is 143033441.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 30481441 + 113848900 = 5521^2 + 10670^2 .
It is a cyclic number.
It is not a de Polignac number, because 144330341 - 22 = 144330337 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144330349) 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 3 ways as a sum of consecutive naturals, for example, 156080 + ... + 157001.
It is an arithmetic number, because the mean of its divisors is an integer number (36160971).
Almost surely, 2144330341 is an apocalyptic number.
It is an amenable number.
144330341 is a deficient number, since it is larger than the sum of its proper divisors (313543).
144330341 is an equidigital number, since it uses as much as digits as its factorization.
144330341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313542.
The product of its (nonzero) digits is 1728, while the sum is 23.
The square root of 144330341 is about 12013.7563234818. The cubic root of 144330341 is about 524.5487775288.
Adding to 144330341 its reverse (143033441), we get a palindrome (287363782).
The spelling of 144330341 in words is "one hundred forty-four million, three hundred thirty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •