Base | Representation |
---|---|
bin | 1001100111101111… |
… | …00100010101010010 |
3 | 111022222011221000112 |
4 | 10303313210111102 |
5 | 41034241001200 |
6 | 2212311321322 |
7 | 241666144433 |
oct | 46367442522 |
9 | 14288157015 |
10 | 5165172050 |
11 | 2210672235 |
12 | 1001980242 |
13 | 64414052c |
14 | 36ddb948a |
15 | 2036d1535 |
hex | 133de4552 |
5165172050 has 24 divisors (see below), whose sum is σ = 10172352276. Its totient is φ = 1944535040.
The previous prime is 5165172041. The next prime is 5165172071. The reversal of 5165172050 is 502715615.
It can be written as a sum of positive squares in 6 ways, for example, as 3497184769 + 1667987281 = 59137^2 + 40841^2 .
It is a super-2 number, since 2×51651720502 = 53358004612202405000, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5165171998 and 5165172016.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3037487 + ... + 3039186.
Almost surely, 25165172050 is an apocalyptic number.
5165172050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5165172050 is a deficient number, since it is larger than the sum of its proper divisors (5007180226).
5165172050 is a wasteful number, since it uses less digits than its factorization.
5165172050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6076702 (or 6076697 counting only the distinct ones).
The product of its (nonzero) digits is 10500, while the sum is 32.
The square root of 5165172050 is about 71869.1314125891. The cubic root of 5165172050 is about 1728.6016800577.
Adding to 5165172050 its reverse (502715615), we get a palindrome (5667887665).
The spelling of 5165172050 in words is "five billion, one hundred sixty-five million, one hundred seventy-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •