Base | Representation |
---|---|
bin | 111110101011100… |
… | …011010111001111 |
3 | 2201021210001002021 |
4 | 332223203113033 |
5 | 4123202320211 |
6 | 252203311011 |
7 | 35026330063 |
oct | 7653432717 |
9 | 2637701067 |
10 | 1051604431 |
11 | 49a66aa79 |
12 | 25421b467 |
13 | 139b37957 |
14 | 9d941aa3 |
15 | 624c6771 |
hex | 3eae35cf |
1051604431 has 4 divisors (see below), whose sum is σ = 1076060392. Its totient is φ = 1027148472.
The previous prime is 1051604401. The next prime is 1051604441. The reversal of 1051604431 is 1344061501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1051604431 is a prime.
It is a super-2 number, since 2×10516044312 = 2211743758597667522, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1051604396 and 1051604405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1051604401) 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, 12227916 + ... + 12228001.
It is an arithmetic number, because the mean of its divisors is an integer number (269015098).
Almost surely, 21051604431 is an apocalyptic number.
1051604431 is a deficient number, since it is larger than the sum of its proper divisors (24455961).
1051604431 is an equidigital number, since it uses as much as digits as its factorization.
1051604431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24455960.
The product of its (nonzero) digits is 1440, while the sum is 25.
The square root of 1051604431 is about 32428.4509497447. The cubic root of 1051604431 is about 1016.9137879013.
Adding to 1051604431 its reverse (1344061501), we get a palindrome (2395665932).
The spelling of 1051604431 in words is "one billion, fifty-one million, six hundred four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •