Base | Representation |
---|---|
bin | 10100100001110… |
… | …111101011100101 |
3 | 220000002111201122 |
4 | 110201313223211 |
5 | 1201133020031 |
6 | 54102103325 |
7 | 11351356046 |
oct | 2441675345 |
9 | 800074648 |
10 | 344423141 |
11 | 167466227 |
12 | 9741ab45 |
13 | 5648299a |
14 | 33a588cd |
15 | 2038647b |
hex | 14877ae5 |
344423141 has 4 divisors (see below), whose sum is σ = 350069484. Its totient is φ = 338776800.
The previous prime is 344423129. The next prime is 344423143. The reversal of 344423141 is 141324443.
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 14092516 + 330330625 = 3754^2 + 18175^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-344423141 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 344423141.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (344423143) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2823080 + ... + 2823201.
It is an arithmetic number, because the mean of its divisors is an integer number (87517371).
Almost surely, 2344423141 is an apocalyptic number.
It is an amenable number.
344423141 is a deficient number, since it is larger than the sum of its proper divisors (5646343).
344423141 is an equidigital number, since it uses as much as digits as its factorization.
344423141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5646342.
The product of its digits is 4608, while the sum is 26.
The square root of 344423141 is about 18558.6406021562. The cubic root of 344423141 is about 700.9667872608.
Adding to 344423141 its reverse (141324443), we get a palindrome (485747584).
The spelling of 344423141 in words is "three hundred forty-four million, four hundred twenty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •