Base | Representation |
---|---|
bin | 11110111111101… |
… | …110110001011101 |
3 | 1100020111220122001 |
4 | 132333232301131 |
5 | 2031111220013 |
6 | 123333522301 |
7 | 15613060300 |
oct | 3677566135 |
9 | 1306456561 |
10 | 520023133 |
11 | 2475a3093 |
12 | 1261a3391 |
13 | 83975bc6 |
14 | 4d0c8b37 |
15 | 309c0ddd |
hex | 1efeec5d |
520023133 has 6 divisors (see below), whose sum is σ = 604924926. Its totient is φ = 445734072.
The previous prime is 520023079. The next prime is 520023151. The reversal of 520023133 is 331320025.
It can be written as a sum of positive squares in only one way, i.e., 294362649 + 225660484 = 17157^2 + 15022^2 .
It is not a de Polignac number, because 520023133 - 213 = 520014941 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 520023133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (520023533) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5306310 + ... + 5306407.
It is an arithmetic number, because the mean of its divisors is an integer number (100820821).
Almost surely, 2520023133 is an apocalyptic number.
It is an amenable number.
520023133 is a deficient number, since it is larger than the sum of its proper divisors (84901793).
520023133 is a wasteful number, since it uses less digits than its factorization.
520023133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10612731 (or 10612724 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 19.
The square root of 520023133 is about 22804.0157209207. The cubic root of 520023133 is about 804.1570760857.
Adding to 520023133 its reverse (331320025), we get a palindrome (851343158).
The spelling of 520023133 in words is "five hundred twenty million, twenty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •