Base | Representation |
---|---|
bin | 111010010110000010000100… |
… | …1011010110000010010100111 |
3 | 2111022002120210021201222121121 |
4 | 1310230010021122300102213 |
5 | 1014231243140320141411 |
6 | 5015253303342554411 |
7 | 213045404501134633 |
oct | 16454041132602247 |
9 | 2438076707658547 |
10 | 513201505240231 |
11 | 139581599632a55 |
12 | 49685a81898a07 |
13 | 19048904476762 |
14 | 90a312a42bdc3 |
15 | 3e4e83773b571 |
hex | 1d2c1096b04a7 |
513201505240231 has 8 divisors (see below), whose sum is σ = 525252784994960. Its totient is φ = 501155514623232.
The previous prime is 513201505240223. The next prime is 513201505240283. The reversal of 513201505240231 is 132042505102315.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 513201505240231 - 23 = 513201505240223 is a prime.
It is a super-2 number, since 2×5132015052402312 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (513201505244231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1322088096 + ... + 1322476213.
It is an arithmetic number, because the mean of its divisors is an integer number (65656598124370).
Almost surely, 2513201505240231 is an apocalyptic number.
513201505240231 is a deficient number, since it is larger than the sum of its proper divisors (12051279754729).
513201505240231 is a wasteful number, since it uses less digits than its factorization.
513201505240231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2644568865.
The product of its (nonzero) digits is 36000, while the sum is 34.
The spelling of 513201505240231 in words is "five hundred thirteen trillion, two hundred one billion, five hundred five million, two hundred forty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •