Base | Representation |
---|---|
bin | 1001100101100000… |
… | …00010001101001101 |
3 | 111021122220020002211 |
4 | 10302300002031031 |
5 | 41014440420140 |
6 | 2210401350421 |
7 | 241350564034 |
oct | 46260021515 |
9 | 14248806084 |
10 | 5146420045 |
11 | 2201024608 |
12 | bb7638411 |
13 | 6402a6180 |
14 | 36b6d771b |
15 | 201c2a2ea |
hex | 132c0234d |
5146420045 has 32 divisors (see below), whose sum is σ = 6790083552. Its totient is φ = 3721116672.
The previous prime is 5146420007. The next prime is 5146420049. The reversal of 5146420045 is 5400246415.
It is a happy number.
It can be written as a sum of positive squares in 16 ways, for example, as 1824742089 + 3321677956 = 42717^2 + 57634^2 .
It is a de Polignac number, because none of the positive numbers 2k-5146420045 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5146419989 and 5146420016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5146420049) 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, 2110567 + ... + 2113003.
It is an arithmetic number, because the mean of its divisors is an integer number (212190111).
Almost surely, 25146420045 is an apocalyptic number.
It is an amenable number.
5146420045 is a deficient number, since it is larger than the sum of its proper divisors (1643663507).
5146420045 is a wasteful number, since it uses less digits than its factorization.
5146420045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3121.
The product of its (nonzero) digits is 19200, while the sum is 31.
The square root of 5146420045 is about 71738.5534074949. The cubic root of 5146420045 is about 1726.5072642750.
The spelling of 5146420045 in words is "five billion, one hundred forty-six million, four hundred twenty thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •