Base | Representation |
---|---|
bin | 101101110010110011… |
… | …101111001010110001 |
3 | 11200220210112201111200 |
4 | 231302303233022301 |
5 | 1301200211233200 |
6 | 34331101001413 |
7 | 3360332643600 |
oct | 556263571261 |
9 | 150823481450 |
10 | 49170805425 |
11 | 19942701985 |
12 | 9643253269 |
13 | 4838037651 |
14 | 2546565a37 |
15 | 142bba2800 |
hex | b72cef2b1 |
49170805425 has 108 divisors (see below), whose sum is σ = 102783739500. Its totient is φ = 22404695040.
The previous prime is 49170805399. The next prime is 49170805427. The reversal of 49170805425 is 52450807194.
It can be written as a sum of positive squares in 6 ways, for example, as 6540118641 + 42630686784 = 80871^2 + 206472^2 .
It is not a de Polignac number, because 49170805425 - 25 = 49170805393 is a prime.
It is a super-2 number, since 2×491708054252 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is not an unprimeable number, because it can be changed into a prime (49170805427) by changing a digit.
It is a polite number, since it can be written in 107 ways as a sum of consecutive naturals, for example, 3443701 + ... + 3457949.
Almost surely, 249170805425 is an apocalyptic number.
49170805425 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
49170805425 is an abundant number, since it is smaller than the sum of its proper divisors (53612934075).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49170805425 is a wasteful number, since it uses less digits than its factorization.
49170805425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14592 (or 14577 counting only the distinct ones).
The product of its (nonzero) digits is 403200, while the sum is 45.
The spelling of 49170805425 in words is "forty-nine billion, one hundred seventy million, eight hundred five thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •