Base | Representation |
---|---|
bin | 101010111111001… |
… | …1010101000111101 |
3 | 10201112011210200011 |
4 | 1111332122220331 |
5 | 10423230103110 |
6 | 355044103221 |
7 | 50513261611 |
oct | 12576325075 |
9 | 3645153604 |
10 | 1442425405 |
11 | 680236613 |
12 | 343094b11 |
13 | 19cab4275 |
14 | d97d7341 |
15 | 8697548a |
hex | 55f9aa3d |
1442425405 has 16 divisors (see below), whose sum is σ = 1751440320. Its totient is φ = 1140291072.
The previous prime is 1442425399. The next prime is 1442425409. The reversal of 1442425405 is 5045242441.
1442425405 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1442425405 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1442425409) 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 15 ways as a sum of consecutive naturals, for example, 379806 + ... + 383584.
It is an arithmetic number, because the mean of its divisors is an integer number (109465020).
Almost surely, 21442425405 is an apocalyptic number.
It is an amenable number.
1442425405 is a deficient number, since it is larger than the sum of its proper divisors (309014915).
1442425405 is an equidigital number, since it uses as much as digits as its factorization.
1442425405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4668.
The product of its (nonzero) digits is 25600, while the sum is 31.
The square root of 1442425405 is about 37979.2759936258. The cubic root of 1442425405 is about 1129.8768772319.
Adding to 1442425405 its reverse (5045242441), we get a palindrome (6487667846).
The spelling of 1442425405 in words is "one billion, four hundred forty-two million, four hundred twenty-five thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •