Base | Representation |
---|---|
bin | 110100010111100100… |
… | …110110111101110111 |
3 | 12101010202212201012002 |
4 | 310113210312331313 |
5 | 1410124402110033 |
6 | 41455354245515 |
7 | 4030302034631 |
oct | 642744667567 |
9 | 171122781162 |
10 | 56230113143 |
11 | 21935484296 |
12 | aa9342689b |
13 | 53c17073c9 |
14 | 2a15d1da51 |
15 | 16e17d43e8 |
hex | d17936f77 |
56230113143 has 4 divisors (see below), whose sum is σ = 57291058728. Its totient is φ = 55169167560.
The previous prime is 56230113133. The next prime is 56230113263. The reversal of 56230113143 is 34131103265.
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-56230113143 is a prime.
It is a super-3 number, since 3×562301131433 (a number of 33 digits) contains 333 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 (56230113133) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 530472713 + ... + 530472818.
It is an arithmetic number, because the mean of its divisors is an integer number (14322764682).
Almost surely, 256230113143 is an apocalyptic number.
56230113143 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
56230113143 is a deficient number, since it is larger than the sum of its proper divisors (1060945585).
56230113143 is a wasteful number, since it uses less digits than its factorization.
56230113143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1060945584.
The product of its (nonzero) digits is 6480, while the sum is 29.
The spelling of 56230113143 in words is "fifty-six billion, two hundred thirty million, one hundred thirteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.201 sec. • engine limits •