Base | Representation |
---|---|
bin | 1010100001000000… |
… | …01110001001011101 |
3 | 112120110011202002220 |
4 | 11100200032021131 |
5 | 43030232404013 |
6 | 2332112335553 |
7 | 256621506240 |
oct | 52040161135 |
9 | 15513152086 |
10 | 5645591133 |
11 | 24378751a6 |
12 | 11168445b9 |
13 | 6bc82ab90 |
14 | 3b7b15257 |
15 | 23097cb23 |
hex | 15080e25d |
5645591133 has 32 divisors (see below), whose sum is σ = 9563430912. Its totient is φ = 2881828800.
The previous prime is 5645591117. The next prime is 5645591177. The reversal of 5645591133 is 3311955465.
5645591133 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 5645591133 - 24 = 5645591117 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5645591033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 325083 + ... + 342008.
It is an arithmetic number, because the mean of its divisors is an integer number (298857216).
Almost surely, 25645591133 is an apocalyptic number.
It is an amenable number.
5645591133 is a deficient number, since it is larger than the sum of its proper divisors (3917839779).
5645591133 is a wasteful number, since it uses less digits than its factorization.
5645591133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 667145.
The product of its digits is 243000, while the sum is 42.
The square root of 5645591133 is about 75137.1488213387. The cubic root of 5645591133 is about 1780.6140974383.
It can be divided in two parts, 5645 and 591133, that added together give a triangular number (596778 = T1092).
The spelling of 5645591133 in words is "five billion, six hundred forty-five million, five hundred ninety-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •