Base | Representation |
---|---|
bin | 101010101001101… |
… | …1100111100010001 |
3 | 10200201222121001202 |
4 | 1111103130330101 |
5 | 10412334201031 |
6 | 354002440545 |
7 | 50315452556 |
oct | 12523347421 |
9 | 3621877052 |
10 | 1431162641 |
11 | 674943747 |
12 | 33b363155 |
13 | 19a66c9cc |
14 | d8104a2d |
15 | 8599d2cb |
hex | 554dcf11 |
1431162641 has 4 divisors (see below), whose sum is σ = 1431238452. Its totient is φ = 1431086832.
The previous prime is 1431162637. The next prime is 1431162659. The reversal of 1431162641 is 1462611341.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 685654225 + 745508416 = 26185^2 + 27304^2 .
It is a cyclic number.
It is not a de Polignac number, because 1431162641 - 22 = 1431162637 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1431162661) 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, 15395 + ... + 55671.
It is an arithmetic number, because the mean of its divisors is an integer number (357809613).
Almost surely, 21431162641 is an apocalyptic number.
It is an amenable number.
1431162641 is a deficient number, since it is larger than the sum of its proper divisors (75811).
1431162641 is an equidigital number, since it uses as much as digits as its factorization.
1431162641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75810.
The product of its digits is 3456, while the sum is 29.
The square root of 1431162641 is about 37830.7102893932. The cubic root of 1431162641 is about 1126.9284168972.
Adding to 1431162641 its reverse (1462611341), we get a palindrome (2893773982).
The spelling of 1431162641 in words is "one billion, four hundred thirty-one million, one hundred sixty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •