Base | Representation |
---|---|
bin | 1010011100001101… |
… | …01100001000111001 |
3 | 112110122102222010222 |
4 | 11032012230020321 |
5 | 42434432000201 |
6 | 2324113545425 |
7 | 255622431131 |
oct | 51606541071 |
9 | 15418388128 |
10 | 5605343801 |
11 | 2417085842 |
12 | 1105275275 |
13 | 6b43a88a5 |
14 | 3b2639ac1 |
15 | 22c17c91b |
hex | 14e1ac239 |
5605343801 has 4 divisors (see below), whose sum is σ = 5676297600. Its totient is φ = 5534390004.
The previous prime is 5605343761. The next prime is 5605343803. The reversal of 5605343801 is 1083435065.
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: 1083435065 = 5 ⋅216687013.
It is a cyclic number.
It is not a de Polignac number, because 5605343801 - 210 = 5605342777 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5605343803) 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, 35476781 + ... + 35476938.
It is an arithmetic number, because the mean of its divisors is an integer number (1419074400).
Almost surely, 25605343801 is an apocalyptic number.
It is an amenable number.
5605343801 is a deficient number, since it is larger than the sum of its proper divisors (70953799).
5605343801 is an equidigital number, since it uses as much as digits as its factorization.
5605343801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70953798.
The product of its (nonzero) digits is 43200, while the sum is 35.
The square root of 5605343801 is about 74868.8439940140. The cubic root of 5605343801 is about 1776.3726789442.
Adding to 5605343801 its reverse (1083435065), we get a palindrome (6688778866).
The spelling of 5605343801 in words is "five billion, six hundred five million, three hundred forty-three thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •