Base | Representation |
---|---|
bin | 1010011110111010… |
… | …10001100110010111 |
3 | 112112020011010201001 |
4 | 11033131101212113 |
5 | 43011234312443 |
6 | 2330244244131 |
7 | 256316364421 |
oct | 51735214627 |
9 | 15466133631 |
10 | 5628041623 |
11 | 2428978a76 |
12 | 11109a0647 |
13 | 6b8cc4c59 |
14 | 3b5667811 |
15 | 22e162d4d |
hex | 14f751997 |
5628041623 has 6 divisors (see below), whose sum is σ = 5939844864. Its totient is φ = 5331828564.
The previous prime is 5628041563. The next prime is 5628041633. The reversal of 5628041623 is 3261408265.
It is not a de Polignac number, because 5628041623 - 225 = 5594487191 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5628041633) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 7794711 + ... + 7795432.
It is an arithmetic number, because the mean of its divisors is an integer number (989974144).
Almost surely, 25628041623 is an apocalyptic number.
5628041623 is a deficient number, since it is larger than the sum of its proper divisors (311803241).
5628041623 is a wasteful number, since it uses less digits than its factorization.
5628041623 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15590181 (or 15590162 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 37.
The square root of 5628041623 is about 75020.2747462311. The cubic root of 5628041623 is about 1778.7671494022.
Adding to 5628041623 its reverse (3261408265), we get a palindrome (8889449888).
It can be divided in two parts, 56280 and 41623, that added together give a triangular number (97903 = T442).
The spelling of 5628041623 in words is "five billion, six hundred twenty-eight million, forty-one thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •