Base | Representation |
---|---|
bin | 10111000101111001100000 |
3 | 102101112210200 |
4 | 113011321200 |
5 | 3022202342 |
6 | 333425200 |
7 | 102311415 |
oct | 27057140 |
9 | 12345720 |
10 | 6053472 |
11 | 3465077 |
12 | 203b200 |
13 | 133c449 |
14 | b3810c |
15 | 7e894c |
hex | 5c5e60 |
6053472 has 36 divisors (see below), whose sum is σ = 17215380. Its totient is φ = 2017728.
The previous prime is 6053461. The next prime is 6053477. The reversal of 6053472 is 2743506.
It is a happy number.
6053472 is a `hidden beast` number, since 60 + 534 + 72 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is an Ulam number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6053477) 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 5 ways as a sum of consecutive naturals, for example, 10222 + ... + 10797.
It is an arithmetic number, because the mean of its divisors is an integer number (478205).
Almost surely, 26053472 is an apocalyptic number.
It is an amenable number.
6053472 is an abundant number, since it is smaller than the sum of its proper divisors (11161908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6053472 is a wasteful number, since it uses less digits than its factorization.
6053472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21035 (or 21024 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 27.
The square root of 6053472 is about 2460.3804583844. The cubic root of 6053472 is about 182.2502695497.
Adding to 6053472 its reverse (2743506), we get a palindrome (8796978).
It can be divided in two parts, 60534 and 72, that added together give a palindrome (60606).
The spelling of 6053472 in words is "six million, fifty-three thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •