Base | Representation |
---|---|
bin | 1111011110001101010… |
… | …00001011101111110100 |
3 | 1212211012001101211102010 |
4 | 13233012220023233310 |
5 | 32202221012300202 |
6 | 1044115252044220 |
7 | 53256606225420 |
oct | 7570650135764 |
9 | 1784161354363 |
10 | 531613400052 |
11 | 1955019a58a9 |
12 | 87044303670 |
13 | 3b19185ac57 |
14 | 1ba31a4db80 |
15 | dc6620676c |
hex | 7bc6a0bbf4 |
531613400052 has 48 divisors (see below), whose sum is σ = 1432250556800. Its totient is φ = 150323668992.
The previous prime is 531613400029. The next prime is 531613400063. The reversal of 531613400052 is 250004316135.
It is a super-2 number, since 2×5316134000522 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 531613399992 and 531613400019.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 32614177 + ... + 32630472.
Almost surely, 2531613400052 is an apocalyptic number.
It is an amenable number.
531613400052 is an abundant number, since it is smaller than the sum of its proper divisors (900637156748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
531613400052 is a wasteful number, since it uses less digits than its factorization.
531613400052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65244760 (or 65244758 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 30.
Adding to 531613400052 its reverse (250004316135), we get a palindrome (781617716187).
The spelling of 531613400052 in words is "five hundred thirty-one billion, six hundred thirteen million, four hundred thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •