Base | Representation |
---|---|
bin | 111010010110001111111010… |
… | …0101111011011100111010101 |
3 | 2111022012102111101011012012122 |
4 | 1310230133310233123213111 |
5 | 1014232240021104010401 |
6 | 5015315100300025325 |
7 | 213050506103641646 |
oct | 16454376457334725 |
9 | 2438172441135178 |
10 | 513231223110101 |
11 | 139593159598491 |
12 | 4968b796232245 |
13 | 1904b65c259742 |
14 | 90a47491d56cd |
15 | 3e504c66d621b |
hex | 1d2c7f4bdb9d5 |
513231223110101 has 64 divisors (see below), whose sum is σ = 572558927947776. Its totient is φ = 457566320640000.
The previous prime is 513231223110091. The next prime is 513231223110121. The reversal of 513231223110101 is 101011322132315.
It is a happy number.
It is not a de Polignac number, because 513231223110101 - 242 = 508833176598997 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (513231223110121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 93297801851 + ... + 93297807351.
It is an arithmetic number, because the mean of its divisors is an integer number (8946233249184).
Almost surely, 2513231223110101 is an apocalyptic number.
It is an amenable number.
513231223110101 is a deficient number, since it is larger than the sum of its proper divisors (59327704837675).
513231223110101 is a wasteful number, since it uses less digits than its factorization.
513231223110101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9542.
The product of its (nonzero) digits is 1080, while the sum is 26.
Adding to 513231223110101 its reverse (101011322132315), we get a palindrome (614242545242416).
The spelling of 513231223110101 in words is "five hundred thirteen trillion, two hundred thirty-one billion, two hundred twenty-three million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •