Base | Representation |
---|---|
bin | 1101011100110… |
… | …1110010111011 |
3 | 10221011022012211 |
4 | 3113031302323 |
5 | 103420324332 |
6 | 5333115551 |
7 | 1253353261 |
oct | 327156273 |
9 | 127138184 |
10 | 56417467 |
11 | 29934307 |
12 | 16a88bb7 |
13 | b8c4422 |
14 | 76c8431 |
15 | 4e46447 |
hex | 35cdcbb |
56417467 has 4 divisors (see below), whose sum is σ = 56432800. Its totient is φ = 56402136.
The previous prime is 56417461. The next prime is 56417483. The reversal of 56417467 is 76471465.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a 3-Lehmer number, since φ(56417467) divides (56417467-1)3.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56417467 is a prime.
It is a super-3 number, since 3×564174673 (a number of 24 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (56417461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1534 + ... + 10732.
It is an arithmetic number, because the mean of its divisors is an integer number (14108200).
Almost surely, 256417467 is an apocalyptic number.
56417467 is the 6133-rd pentagonal number.
56417467 is a deficient number, since it is larger than the sum of its proper divisors (15333).
56417467 is an equidigital number, since it uses as much as digits as its factorization.
56417467 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15332.
The product of its digits is 141120, while the sum is 40.
The square root of 56417467 is about 7511.1561693257. The cubic root of 56417467 is about 383.5345810741.
The spelling of 56417467 in words is "fifty-six million, four hundred seventeen thousand, four hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •