Base | Representation |
---|---|
bin | 1001010110000101… |
… | …11011111100111001 |
3 | 110221122200000010200 |
4 | 10223002323330321 |
5 | 40233343014213 |
6 | 2145503032413 |
7 | 235221064101 |
oct | 45302737471 |
9 | 13848600120 |
10 | 5017157433 |
11 | 2145066702 |
12 | b8029b709 |
13 | 61c588212 |
14 | 35848a201 |
15 | 1e56e5273 |
hex | 12b0bbf39 |
5017157433 has 6 divisors (see below), whose sum is σ = 7247005194. Its totient is φ = 3344771616.
The previous prime is 5017157389. The next prime is 5017157437. The reversal of 5017157433 is 3347517105.
5017157433 is a `hidden beast` number, since 5 + 0 + 171 + 57 + 433 = 666.
It can be written as a sum of positive squares in only one way, i.e., 4957990569 + 59166864 = 70413^2 + 7692^2 .
It is not a de Polignac number, because 5017157433 - 28 = 5017157177 is a prime.
It is not an unprimeable number, because it can be changed into a prime (5017157437) by changing a digit.
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, 278730960 + ... + 278730977.
It is an arithmetic number, because the mean of its divisors is an integer number (1207834199).
Almost surely, 25017157433 is an apocalyptic number.
It is an amenable number.
5017157433 is a deficient number, since it is larger than the sum of its proper divisors (2229847761).
5017157433 is a wasteful number, since it uses less digits than its factorization.
5017157433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 557461943 (or 557461940 counting only the distinct ones).
The product of its (nonzero) digits is 44100, while the sum is 36.
The square root of 5017157433 is about 70831.8955908989. The cubic root of 5017157433 is about 1711.9296335435.
The spelling of 5017157433 in words is "five billion, seventeen million, one hundred fifty-seven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •