Base | Representation |
---|---|
bin | 11010011111100010… |
… | …10100010111101001 |
3 | 1100201020111222011122 |
4 | 31033301110113221 |
5 | 213112121333231 |
6 | 10311205105025 |
7 | 1012315315100 |
oct | 151761242751 |
9 | 40636458148 |
10 | 14223230441 |
11 | 6039708602 |
12 | 290b3b8175 |
13 | 145893aab4 |
14 | 98cdc5037 |
15 | 583a2a77b |
hex | 34fc545e9 |
14223230441 has 18 divisors (see below), whose sum is σ = 16593544170. Its totient is φ = 12155943072.
The previous prime is 14223230401. The next prime is 14223230447. The reversal of 14223230441 is 14403232241.
It can be written as a sum of positive squares in only one way, i.e., 13783699216 + 439531225 = 117404^2 + 20965^2 .
It is not a de Polignac number, because 14223230441 - 218 = 14222968297 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14223230441.
It is not an unprimeable number, because it can be changed into a prime (14223230447) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 17580845 + ... + 17581653.
It is an arithmetic number, because the mean of its divisors is an integer number (921863565).
Almost surely, 214223230441 is an apocalyptic number.
It is an amenable number.
14223230441 is a deficient number, since it is larger than the sum of its proper divisors (2370313729).
14223230441 is an frugal number, since it uses more digits than its factorization.
14223230441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2021 (or 1415 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 14223230441 its reverse (14403232241), we get a palindrome (28626462682).
The spelling of 14223230441 in words is "fourteen billion, two hundred twenty-three million, two hundred thirty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •