Base | Representation |
---|---|
bin | 10111000110011000110001 |
3 | 102101122112210 |
4 | 113012120301 |
5 | 3022233343 |
6 | 333442333 |
7 | 102320304 |
oct | 27063061 |
9 | 12348483 |
10 | 6055473 |
11 | 3466626 |
12 | 20403a9 |
13 | 1340328 |
14 | b38b3b |
15 | 7e9333 |
hex | 5c6631 |
6055473 has 8 divisors (see below), whose sum is σ = 8152768. Its totient is φ = 3997584.
The previous prime is 6055453. The next prime is 6055477. The reversal of 6055473 is 3745506.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 6055473 - 218 = 5793329 is a prime.
It is a super-4 number, since 4×60554734 (a number of 28 digits) contains 4444 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 6055473.
It is not an unprimeable number, because it can be changed into a prime (6055477) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9490 + ... + 10107.
It is an arithmetic number, because the mean of its divisors is an integer number (1019096).
Almost surely, 26055473 is an apocalyptic number.
It is an amenable number.
6055473 is a deficient number, since it is larger than the sum of its proper divisors (2097295).
6055473 is a wasteful number, since it uses less digits than its factorization.
6055473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19703.
The product of its (nonzero) digits is 12600, while the sum is 30.
The square root of 6055473 is about 2460.7870692118. The cubic root of 6055473 is about 182.2703485289.
It can be divided in two parts, 605547 and 3, that added together give a triangular number (605550 = T1100).
The spelling of 6055473 in words is "six million, fifty-five thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •