Base | Representation |
---|---|
bin | 101000011111100110110… |
… | …0000001001010110110111 |
3 | 201201001100102011202222211 |
4 | 1100333031200021112313 |
5 | 1212141000140421120 |
6 | 15500420132234251 |
7 | 1113042360620431 |
oct | 120771540112667 |
9 | 21631312152884 |
10 | 5565430404535 |
11 | 1856316411351 |
12 | 75a74b46b987 |
13 | 314a82a26531 |
14 | 15352275b651 |
15 | 99b826cb25a |
hex | 50fcd8095b7 |
5565430404535 has 8 divisors (see below), whose sum is σ = 6689628829296. Its totient is φ = 4444936094400.
The previous prime is 5565430404529. The next prime is 5565430404539. The reversal of 5565430404535 is 5354040345655.
5565430404535 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5565430404535 - 223 = 5565422015927 is a prime.
It is a super-2 number, since 2×55654304045352 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5565430404539) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 926025349 + ... + 926031358.
It is an arithmetic number, because the mean of its divisors is an integer number (836203603662).
Almost surely, 25565430404535 is an apocalyptic number.
5565430404535 is a deficient number, since it is larger than the sum of its proper divisors (1124198424761).
5565430404535 is a wasteful number, since it uses less digits than its factorization.
5565430404535 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1852057313.
The product of its (nonzero) digits is 10800000, while the sum is 49.
The spelling of 5565430404535 in words is "five trillion, five hundred sixty-five billion, four hundred thirty million, four hundred four thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •