Base | Representation |
---|---|
bin | 1010011111001110… |
… | …01111001001111101 |
3 | 112112102001210220200 |
4 | 11033213033021331 |
5 | 43012421344203 |
6 | 2330420234113 |
7 | 256350522054 |
oct | 51747171175 |
9 | 15472053820 |
10 | 5630653053 |
11 | 242a3a1a83 |
12 | 111183b939 |
13 | 6b96ca78c |
14 | 3b5b4739b |
15 | 22e4cb9a3 |
hex | 14f9cf27d |
5630653053 has 12 divisors (see below), whose sum is σ = 8168997408. Its totient is φ = 3737230920.
The previous prime is 5630653037. The next prime is 5630653073. The reversal of 5630653053 is 3503560365.
5630653053 is a `hidden beast` number, since 563 + 0 + 65 + 30 + 5 + 3 = 666.
5630653053 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5630653053 - 24 = 5630653037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5630652999 and 5630653017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5630653073) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1375993 + ... + 1380078.
It is an arithmetic number, because the mean of its divisors is an integer number (680749784).
Almost surely, 25630653053 is an apocalyptic number.
It is an amenable number.
5630653053 is a deficient number, since it is larger than the sum of its proper divisors (2538344355).
5630653053 is a wasteful number, since it uses less digits than its factorization.
5630653053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2756304 (or 2756301 counting only the distinct ones).
The product of its (nonzero) digits is 121500, while the sum is 36.
The square root of 5630653053 is about 75037.6775560118. The cubic root of 5630653053 is about 1779.0422248158.
The spelling of 5630653053 in words is "five billion, six hundred thirty million, six hundred fifty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •