Base | Representation |
---|---|
bin | 1101010111011… |
… | …1011110111011 |
3 | 10220111100020220 |
4 | 3111313132323 |
5 | 103323021211 |
6 | 5321351123 |
7 | 1250351460 |
oct | 325673673 |
9 | 126440226 |
10 | 56063931 |
11 | 29712730 |
12 | 169384a3 |
13 | b7cc531 |
14 | 7635667 |
15 | 4dc6806 |
hex | 35777bb |
56063931 has 32 divisors (see below), whose sum is σ = 96422400. Its totient is φ = 28116480.
The previous prime is 56063929. The next prime is 56063947. The reversal of 56063931 is 13936065.
56063931 = 8152 + 8162 + ... + 8912.
It is not a de Polignac number, because 56063931 - 21 = 56063929 is a prime.
It is a super-2 number, since 2×560639312 = 6286328718345522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a plaindrome in base 16.
It is a junction number, because it is equal to n+sod(n) for n = 56063892 and 56063901.
It is not an unprimeable number, because it can be changed into a prime (56063911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2515 + ... + 10883.
It is an arithmetic number, because the mean of its divisors is an integer number (3013200).
Almost surely, 256063931 is an apocalyptic number.
56063931 is a deficient number, since it is larger than the sum of its proper divisors (40358469).
56063931 is a wasteful number, since it uses less digits than its factorization.
56063931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8419.
The product of its (nonzero) digits is 14580, while the sum is 33.
The square root of 56063931 is about 7487.5851247248. The cubic root of 56063931 is about 382.7317711906.
Adding to 56063931 its reverse (13936065), we get a palindrome (69999996).
The spelling of 56063931 in words is "fifty-six million, sixty-three thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •