Base | Representation |
---|---|
bin | 1101010110111… |
… | …0111111001011 |
3 | 10220102120112000 |
4 | 3111232333023 |
5 | 103320413011 |
6 | 5320522043 |
7 | 1250145144 |
oct | 325567713 |
9 | 126376460 |
10 | 56029131 |
11 | 29699574 |
12 | 16920323 |
13 | b7b9742 |
14 | 7626acb |
15 | 4dbb356 |
hex | 356efcb |
56029131 has 32 divisors (see below), whose sum is σ = 86592000. Its totient is φ = 35761824.
The previous prime is 56029111. The next prime is 56029139. The reversal of 56029131 is 13192065.
It is a de Polignac number, because none of the positive numbers 2k-56029131 is a prime.
It is a super-2 number, since 2×560291312 = 6278527041230322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 56029095 and 56029104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56029139) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 127410 + ... + 127848.
It is an arithmetic number, because the mean of its divisors is an integer number (2706000).
Almost surely, 256029131 is an apocalyptic number.
56029131 is a deficient number, since it is larger than the sum of its proper divisors (30562869).
56029131 is a wasteful number, since it uses less digits than its factorization.
56029131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 640 (or 634 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
The square root of 56029131 is about 7485.2609172961. The cubic root of 56029131 is about 382.6525650525.
The spelling of 56029131 in words is "fifty-six million, twenty-nine thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.670 sec. • engine limits •