Base | Representation |
---|---|
bin | 11001100100100010111110… |
… | …00010100101011000000011 |
3 | 21101002122211102101222010212 |
4 | 30302101133002211120003 |
5 | 24332243203411232011 |
6 | 315332145554144335 |
7 | 14562402122453051 |
oct | 1462213702453003 |
9 | 241078742358125 |
10 | 56231306352131 |
11 | 16a0a621541429 |
12 | 63820068820ab |
13 | 254b787cb7351 |
14 | dc58772191d1 |
15 | 677a8a6dd08b |
hex | 33245f0a5603 |
56231306352131 has 4 divisors (see below), whose sum is σ = 56231888186064. Its totient is φ = 56230724518200.
The previous prime is 56231306352113. The next prime is 56231306352157. The reversal of 56231306352131 is 13125360313265.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56231306352131 is a prime.
It is a super-2 number, since 2×562313063521312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (56231306352731) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 290771975 + ... + 290965296.
It is an arithmetic number, because the mean of its divisors is an integer number (14057972046516).
Almost surely, 256231306352131 is an apocalyptic number.
56231306352131 is a deficient number, since it is larger than the sum of its proper divisors (581833933).
56231306352131 is an equidigital number, since it uses as much as digits as its factorization.
56231306352131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 581833932.
The product of its (nonzero) digits is 291600, while the sum is 41.
Adding to 56231306352131 its reverse (13125360313265), we get a palindrome (69356666665396).
The spelling of 56231306352131 in words is "fifty-six trillion, two hundred thirty-one billion, three hundred six million, three hundred fifty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •