Base | Representation |
---|---|
bin | 110100100111000101… |
… | …011101111100001111 |
3 | 12101210220111120101102 |
4 | 310213011131330033 |
5 | 1411143010212011 |
6 | 41541251333315 |
7 | 4036611536264 |
oct | 644705357417 |
9 | 171726446342 |
10 | 56490319631 |
11 | 21a59349279 |
12 | ab465b123b |
13 | 54335b1645 |
14 | 2a3c6d526b |
15 | 170958273b |
hex | d2715df0f |
56490319631 has 4 divisors (see below), whose sum is σ = 56491908672. Its totient is φ = 56488730592.
The previous prime is 56490319591. The next prime is 56490319649. The reversal of 56490319631 is 13691309465.
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-56490319631 is a prime.
It is a super-2 number, since 2×564903196312 (a number of 22 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 (56490319651) 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, 739946 + ... + 812711.
It is an arithmetic number, because the mean of its divisors is an integer number (14122977168).
Almost surely, 256490319631 is an apocalyptic number.
56490319631 is a deficient number, since it is larger than the sum of its proper divisors (1589041).
56490319631 is a wasteful number, since it uses less digits than its factorization.
56490319631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1589040.
The product of its (nonzero) digits is 524880, while the sum is 47.
The spelling of 56490319631 in words is "fifty-six billion, four hundred ninety million, three hundred nineteen thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •