Base | Representation |
---|---|
bin | 1010100000101111… |
… | …00101010001010111 |
3 | 112120021220200200111 |
4 | 11100113211101113 |
5 | 43024142422201 |
6 | 2331552023451 |
7 | 256563325042 |
oct | 52027452127 |
9 | 15507820614 |
10 | 5643326551 |
11 | 2436568845 |
12 | 1115b31b87 |
13 | 6bc2171a5 |
14 | 3b76c5c59 |
15 | 230681b51 |
hex | 1505e5457 |
5643326551 has 8 divisors (see below), whose sum is σ = 5783097600. Its totient is φ = 5503656960.
The previous prime is 5643326509. The next prime is 5643326561. The reversal of 5643326551 is 1556233465.
5643326551 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 a cyclic number.
It is not a de Polignac number, because 5643326551 - 227 = 5509108823 is a prime.
It is a super-2 number, since 2×56433265512 = 63694269122443111202, which 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 (5643326561) 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, 94135 + ... + 141943.
It is an arithmetic number, because the mean of its divisors is an integer number (722887200).
Almost surely, 25643326551 is an apocalyptic number.
5643326551 is a deficient number, since it is larger than the sum of its proper divisors (139771049).
5643326551 is a wasteful number, since it uses less digits than its factorization.
5643326551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50729.
The product of its digits is 324000, while the sum is 40.
The square root of 5643326551 is about 75122.0776536432. The cubic root of 5643326551 is about 1780.3759832582.
The spelling of 5643326551 in words is "five billion, six hundred forty-three million, three hundred twenty-six thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •