Base | Representation |
---|---|
bin | 1101011101000… |
… | …1101100010111 |
3 | 10221012010010002 |
4 | 3113101230113 |
5 | 103421332211 |
6 | 5333321515 |
7 | 1253450645 |
oct | 327215427 |
9 | 127163102 |
10 | 56433431 |
11 | 299452aa |
12 | 16a9629b |
13 | b8cb782 |
14 | 76d0195 |
15 | 4e4b03b |
hex | 35d1b17 |
56433431 has 4 divisors (see below), whose sum is σ = 56534232. Its totient is φ = 56332632.
The previous prime is 56433383. The next prime is 56433437. The reversal of 56433431 is 13433465.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13433465 = 5 ⋅2686693.
It is a cyclic number.
It is not a de Polignac number, because 56433431 - 26 = 56433367 is a prime.
It is a super-2 number, since 2×564334312 = 6369464268863522, 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 = 56433394 and 56433403.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56433437) 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, 49556 + ... + 50681.
It is an arithmetic number, because the mean of its divisors is an integer number (14133558).
Almost surely, 256433431 is an apocalyptic number.
56433431 is a deficient number, since it is larger than the sum of its proper divisors (100801).
56433431 is a wasteful number, since it uses less digits than its factorization.
56433431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100800.
The product of its digits is 12960, while the sum is 29.
The square root of 56433431 is about 7512.2187800942. The cubic root of 56433431 is about 383.5707529015.
Adding to 56433431 its reverse (13433465), we get a palindrome (69866896).
The spelling of 56433431 in words is "fifty-six million, four hundred thirty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •