Base | Representation |
---|---|
bin | 10010001001000000000001 |
3 | 22221121021001 |
4 | 102021000001 |
5 | 2204133312 |
6 | 245532001 |
7 | 55264210 |
oct | 22110001 |
9 | 8847231 |
10 | 4755457 |
11 | 2758933 |
12 | 1714001 |
13 | ca66a5 |
14 | 8bb077 |
15 | 63e057 |
hex | 489001 |
4755457 has 8 divisors (see below), whose sum is σ = 5671296. Its totient is φ = 3898752.
The previous prime is 4755451. The next prime is 4755463. The reversal of 4755457 is 7545574.
It is an interprime number because it is at equal distance from previous prime (4755451) and next prime (4755463).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4755457 is a prime.
It is a super-2 number, since 2×47554572 = 45228742557698, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (4755451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (5) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14608 + ... + 14929.
It is an arithmetic number, because the mean of its divisors is an integer number (708912).
It is a Proth number, since it is equal to 1161 ⋅ 212 + 1 and 1161 < 212.
Almost surely, 24755457 is an apocalyptic number.
It is an amenable number.
4755457 is a deficient number, since it is larger than the sum of its proper divisors (915839).
4755457 is a wasteful number, since it uses less digits than its factorization.
4755457 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29567.
The product of its digits is 98000, while the sum is 37.
The square root of 4755457 is about 2180.7010340714. The cubic root of 4755457 is about 168.1631186859.
The spelling of 4755457 in words is "four million, seven hundred fifty-five thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •