Base | Representation |
---|---|
bin | 1010001111110011… |
… | …11101011011000001 |
3 | 112012101202012110012 |
4 | 11013321331123001 |
5 | 42231320442200 |
6 | 2305520514305 |
7 | 253220435054 |
oct | 50771753301 |
9 | 15171665405 |
10 | 5501343425 |
11 | 2373401816 |
12 | 109647b995 |
13 | 6989942c6 |
14 | 3a28c6a9b |
15 | 222e87a35 |
hex | 147e7d6c1 |
5501343425 has 6 divisors (see below), whose sum is σ = 6821665878. Its totient is φ = 4401074720.
The previous prime is 5501343349. The next prime is 5501343433. The reversal of 5501343425 is 5243431055.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 487570561 + 5013772864 = 22081^2 + 70808^2 .
It is not a de Polignac number, because 5501343425 - 224 = 5484566209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5501343391 and 5501343400.
It is an unprimeable number.
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, 110026844 + ... + 110026893.
It is an arithmetic number, because the mean of its divisors is an integer number (1136944313).
Almost surely, 25501343425 is an apocalyptic number.
It is an amenable number.
5501343425 is a deficient number, since it is larger than the sum of its proper divisors (1320322453).
5501343425 is a wasteful number, since it uses less digits than its factorization.
5501343425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220053747 (or 220053742 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 32.
The square root of 5501343425 is about 74171.0416874403. The cubic root of 5501343425 is about 1765.3178759088.
The spelling of 5501343425 in words is "five billion, five hundred one million, three hundred forty-three thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •