Base | Representation |
---|---|
bin | 1101011101000… |
… | …1000110110111 |
3 | 10221011222211012 |
4 | 3113101012313 |
5 | 103421243111 |
6 | 5333302435 |
7 | 1253440646 |
oct | 327210667 |
9 | 127158735 |
10 | 56431031 |
11 | 29943518 |
12 | 16a94a1b |
13 | b8ca657 |
14 | 76cd35d |
15 | 4e4a48b |
hex | 35d11b7 |
56431031 has 4 divisors (see below), whose sum is σ = 57956232. Its totient is φ = 54905832.
The previous prime is 56431009. The next prime is 56431057. The reversal of 56431031 is 13013465.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13013465 = 5 ⋅2602693.
It is a cyclic number.
It is not a de Polignac number, because 56431031 - 210 = 56430007 is a prime.
It is a super-2 number, since 2×564310312 = 6368922519445922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 56430988 and 56431006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56431091) 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, 762545 + ... + 762618.
It is an arithmetic number, because the mean of its divisors is an integer number (14489058).
Almost surely, 256431031 is an apocalyptic number.
56431031 is a deficient number, since it is larger than the sum of its proper divisors (1525201).
56431031 is a wasteful number, since it uses less digits than its factorization.
56431031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1525200.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 56431031 is about 7512.0590386391. The cubic root of 56431031 is about 383.5653153276.
Adding to 56431031 its reverse (13013465), we get a palindrome (69444496).
The spelling of 56431031 in words is "fifty-six million, four hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •