Base | Representation |
---|---|
bin | 1010000110110011… |
… | …00010011110111001 |
3 | 112000010110221000201 |
4 | 11003121202132321 |
5 | 42102442014414 |
6 | 2254220202201 |
7 | 251311664110 |
oct | 50331423671 |
9 | 15003427021 |
10 | 5425735609 |
11 | 2334760518 |
12 | 1075099361 |
13 | 686111158 |
14 | 396844c77 |
15 | 21b500574 |
hex | 1436627b9 |
5425735609 has 4 divisors (see below), whose sum is σ = 6200840704. Its totient is φ = 4650630516.
The previous prime is 5425735607. The next prime is 5425735633. The reversal of 5425735609 is 9065375245.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 9065375245 = 5 ⋅1813075049.
It is not a de Polignac number, because 5425735609 - 21 = 5425735607 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5425735603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 387552537 + ... + 387552550.
It is an arithmetic number, because the mean of its divisors is an integer number (1550210176).
Almost surely, 25425735609 is an apocalyptic number.
It is an amenable number.
5425735609 is a deficient number, since it is larger than the sum of its proper divisors (775105095).
5425735609 is an equidigital number, since it uses as much as digits as its factorization.
5425735609 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 775105094.
The product of its (nonzero) digits is 1134000, while the sum is 46.
The square root of 5425735609 is about 73659.5927832893. The cubic root of 5425735609 is about 1757.1933150410.
The spelling of 5425735609 in words is "five billion, four hundred twenty-five million, seven hundred thirty-five thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •