Base | Representation |
---|---|
bin | 111001100010100110101010… |
… | …0000010101110011110110111 |
3 | 2110101001212100210200112000221 |
4 | 1303011031110002232132313 |
5 | 1012314441334203011401 |
6 | 4552242222343115211 |
7 | 211415630354010526 |
oct | 16305152402563667 |
9 | 2411055323615027 |
10 | 506133241063351 |
11 | 1372a69a1794200 |
12 | 4892401a442b07 |
13 | 18955210213675 |
14 | 8cdad9dd4c4bd |
15 | 3d7aa490097a1 |
hex | 1cc53540ae7b7 |
506133241063351 has 48 divisors (see below), whose sum is σ = 562199372935200. Its totient is φ = 455277193620480.
The previous prime is 506133241063327. The next prime is 506133241063367. The reversal of 506133241063351 is 153360142331605.
It is not a de Polignac number, because 506133241063351 - 229 = 506132704192439 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 506133241063298 and 506133241063307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (506133241463351) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 72109020720 + ... + 72109027738.
It is an arithmetic number, because the mean of its divisors is an integer number (11712486936150).
Almost surely, 2506133241063351 is an apocalyptic number.
506133241063351 is a deficient number, since it is larger than the sum of its proper divisors (56066131871849).
506133241063351 is a wasteful number, since it uses less digits than its factorization.
506133241063351 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13840 (or 13829 counting only the distinct ones).
The product of its (nonzero) digits is 583200, while the sum is 43.
Adding to 506133241063351 its reverse (153360142331605), we get a palindrome (659493383394956).
The spelling of 506133241063351 in words is "five hundred six trillion, one hundred thirty-three billion, two hundred forty-one million, sixty-three thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •