Base | Representation |
---|---|
bin | 111001100010011101011101… |
… | …1101001110101001100110100 |
3 | 2110100222222102022220210210121 |
4 | 1303010322323221311030310 |
5 | 1012314130424130000002 |
6 | 4552225200104501324 |
7 | 211414331311160602 |
oct | 16304727351651464 |
9 | 2410888368823717 |
10 | 506113504531252 |
11 | 137299593a57552 |
12 | 4892023077a844 |
13 | 189533b62b55c7 |
14 | 8cda04aa4a872 |
15 | 3d7a291483237 |
hex | 1cc4ebba75334 |
506113504531252 has 6 divisors (see below), whose sum is σ = 885698632929698. Its totient is φ = 253056752265624.
The previous prime is 506113504531241. The next prime is 506113504531253. The reversal of 506113504531252 is 252135405311605.
It can be written as a sum of positive squares in only one way, i.e., 480512879724816 + 25600624806436 = 21920604^2 + 5059706^2 .
It is a junction number, because it is equal to n+sod(n) for n = 506113504531199 and 506113504531208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (506113504531253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 63264188066403 + ... + 63264188066410.
Almost surely, 2506113504531252 is an apocalyptic number.
It is an amenable number.
506113504531252 is a deficient number, since it is larger than the sum of its proper divisors (379585128398446).
506113504531252 is a wasteful number, since it uses less digits than its factorization.
506113504531252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126528376132817 (or 126528376132815 counting only the distinct ones).
The product of its (nonzero) digits is 540000, while the sum is 43.
Adding to 506113504531252 its reverse (252135405311605), we get a palindrome (758248909842857).
The spelling of 506113504531252 in words is "five hundred six trillion, one hundred thirteen billion, five hundred four million, five hundred thirty-one thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •